scientific article; zbMATH DE number 3825881

zbMATH Open0522.05070MaRDI QIDQ3672042FDOQ3672042

Authors: J. Nešetřil, Vojtěch Rödl, P. Erdős 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• Some recent results on Ramsey-type numbers
• Problems and results in combinatorial analysis and graph theory
• Recent developments in graph Ramsey theory
• Graph partitions: recent progresses and some open problems
• A Canonical Ramsey Theorem

zbMATH Keywords

unrestricted partitionsFolkman graphRamsey graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05C99)

Cited In (29)

• Elegantly colored paths and cycles in edge colored random graphs
• Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Color degree and heterochromatic cycles in edge-colored graphs
• A rainbow blow-up lemma for almost optimally bounded edge-colourings
• Polychromatic Hamilton cycles
• Anti-Ramsey properties of random graphs
• Extremal results for Berge hypergraphs
• On partitioning the edges of graphs into connected subgraphs
• A rainbow blow-up lemma for almost optimally bounded edge-colourings
• Labeled traveling salesman problems: complexity and approximation
• Extensions of results on rainbow Hamilton cycles in uniform hypergraphs
• Power of \(k\) choices and rainbow spanning trees in random graphs
• Title not available (Why is that?)
• Sub-Ramsey numbers for matchings
• Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
• ON TWO GRAPH PARTITIONING QUESTIONS
• Title not available (Why is that?)
• Rainbow pancyclicity in graph systems
• On Erdős-Rado numbers
• A rainbow blow-up lemma
• Polychromatic cliques
• Title not available (Why is that?)
• Long rainbow paths and rainbow cycles in edge colored graphs. A survey
• Long directed rainbow cycles and rainbow spanning trees
• On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs
• Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
• Rainbow triangles in arc-colored digraphs

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 Q3672042)