Holes in graphs
From MaRDI portal
Publication:5954318
zbMath0992.05048MaRDI QIDQ5954318
Andrzej Ruciński, Yue Jian Peng, Vojtěch Rödl
Publication date: 7 February 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121976
Related Items (10)
Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ Bounds for graph regularity and removal lemmas ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ A further extension of Rödl's theorem ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ On the number of symbols that forces a transversal ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs ⋮ Almost-spanning subgraphs with bounded degree in dense graphs ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
This page was built for publication: Holes in graphs
