scientific article

zbMath0312.05123MaRDI QIDQ4071274

L. Posa, Paul Erdős, Andras Hajnal

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Other combinatorial set theory (03E05)

Related Items

Partition properties of q-hypergraphs, The Ramsey theory of Henson graphs, On universality of graphs with uniformly distributed edges, Local \(k\)-colorings of graphs and hypergraphs, Induced partition properties of combinatorial cubes, Ramsey properties of products of chains, Some recent results on Ramsey-type numbers, A Ramsey class for Steiner systems, A note on lower bounds for induced Ramsey numbers, A short proof of the induced Ramsey theorem for hypergraphs, Ramsey theory of homogeneous structures: current trends and open problems, A Note on Induced Ramsey Numbers, Partition theorems for parameter systems and graphs, The Ramsey theory of the universal homogeneous triangle-free graph, Extremal results in sparse pseudorandom graphs, Embedding finite graphs into graphs colored with infinitely many colors, Induced Ramsey-type theorems, King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments, On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property, An efficient container lemma, Iterated combinatorial density theorems, Induced partition theorems, Edge partitions of the countable triangle free homogeneous graph, The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma, On the use of senders in generalized Ramsey theory for graphs, Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete., Ramsey theory for countable binary homogeneous structures