scientific article
From MaRDI portal
Publication:3672042
zbMath0522.05070MaRDI QIDQ3672042
Jaroslav Nešetřil, Vojtěch Rödl, Paul Erdős
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Generalized Ramsey theory (05C55) Graph theory (05C99)
Related Items
Polychromatic cliques ⋮ Rainbow triangles in arc-colored digraphs ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ Sub-Ramsey numbers for matchings ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ 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 ⋮ Extremal Results for Berge Hypergraphs ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Polychromatic Hamilton cycles ⋮ 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] ⋮ Rainbow pancyclicity in graph systems ⋮ On Erdős-Rado numbers ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ ⋮ Extensions of results on rainbow Hamilton cycles in uniform hypergraphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
