scientific article; zbMATH DE number 4142066

MaRDI QIDQ3474665zbMATH OpenFDO

Authors Péter Komjáth, István Szalkai, Andras Hajnal, Lajos Soukup

Publication date 1988

zbMATH Keywords

coloringcomplete graphconnectivitydecomposition

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Erdős-Kakutani phenomena for paths
• A consistent edge partition theorem for infinite graphs
• Decomposition of an infinite complete graph into complete bipartite subgraphs

Cited in

(8)

• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Vertex coverings by monochromatic cycles and trees
• Partitioning complete bipartite graphs by monochromatic cycles
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Ramsey theory for highly connected monochromatic subgraphs
• Erdős-Kakutani phenomena for paths
• Generalizations and strengthenings of Ryser's conjecture
• More on decompositions of edge-colored complete graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474665)