scientific article; zbMATH DE number 3536154
From MaRDI portal
Publication:4111618
zbMath0344.05150MaRDI QIDQ4111618
Jaroslav Nešetřil, Vojtěch Rödl
Publication date: 1976
Full work available at URL: https://eudml.org/doc/16735
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Ramsey Property of Families of Graphs ⋮ Subgraph transversal of graphs ⋮ The complexity of \(G\)-free colourability ⋮ The partite construction and Ramsey set systems ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ The complexity of generalized graph colorings ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On some generalized vertex Folkman numbers ⋮ Some infinite families of Ramsey \((P_{3},P_{n})\)-minimal trees ⋮ Infinite Ramsey-minimal graphs for star forests ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On vertex Ramsey graphs with forbidden subgraphs ⋮ Amalgamation of matroids and its applications ⋮ Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs ⋮ Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite ⋮ Splittings and Ramsey properties of permutation classes ⋮ Ramsey-type properties of relational structures ⋮ Embedding finite graphs into graphs colored with infinitely many colors ⋮ Graph properties and hypergraph colourings ⋮ Ramsey-type results for metric spaces ⋮ EPPA for two-graphs and antipodal metric spaces ⋮ Embedding Graphs into Colored Graphs ⋮ Two proofs of the Ramsey property of the class of finite hypergraphs ⋮ Vertex Ramsey properties of families of graphs
