Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
From MaRDI portal
Publication:1088687
DOI10.1016/0012-365X(86)90038-5zbMath0613.05044WikidataQ122872444 ScholiaQ122872444MaRDI QIDQ1088687
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (40)
Polychromatic cliques ⋮ Rainbow triangles in arc-colored digraphs ⋮ Rainbow Ramsey simple structures ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests ⋮ Properly coloured copies and rainbow copies of large graphs with small maximum degree ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Sub-Ramsey numbers for matchings ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ On the approximability of the minimum rainbow subgraph problem and other related problems ⋮ On an anti‐Ramsey property of Ramanujan graphs ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Labeled traveling salesman problems: complexity and approximation ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ A counterexample to Stein’s Equi-$n$-square Conjecture ⋮ A rainbow blow‐up lemma ⋮ A Rainbow Dirac's Theorem ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Polychromatic Hamilton cycles ⋮ Better lower and upper bounds for the minimum rainbow subgraph problem ⋮ Rainbow hamilton cycles in random graphs ⋮ Rainbow and orthogonal paths in factorizations ofKn ⋮ Anti-Ramsey properties of random graphs ⋮ Power of \(k\) choices and rainbow spanning trees in random graphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Color degree condition for long rainbow paths in edge-colored graphs ⋮ Rainbow pancyclicity in graph systems ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Compatible Hamilton cycles in random graphs ⋮ The heterochromatic cycles in edge-colored graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs ⋮ Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
Cites Work
This page was built for publication: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
