An edge-colored graph is a graph where each edge is assigned a color.In this talk, we introduce some studies on subgraphs with certain conditions in edge-colored graphs, for example, properly colored Hamilton cycles and properly colored spanning trees, and speaker's results. In addition, we discuss a relationship to a maroid. For example, we study a relationship between Rota's colorful conjecture and a decomposition of edge-colored graphs.