The Ramsey property for graphs with forbidden complete subgraphs
From MaRDI portal
Publication:1227013
DOI10.1016/0095-8956(76)90015-0zbMath0329.05115OpenAlexW2050095135MaRDI QIDQ1227013
Vojtěch Rödl, Jaroslav Nešetřil
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90015-0
Related Items
Large triangle-free subgraphs in graphs without \(K_ 4\), Degree Ramsey Numbers of Graphs, Towards the 0-statement of the Kohayakawa-Kreuter conjecture, A consistent edge partition theorem for infinite graphs, A Folkman Linear Family, Local \(k\)-colorings of graphs and hypergraphs, Reducts of the random graph, Ramsey-type numbers involving graphs and hypergraphs with large girth, Finite union theorem with restrictions, The chromatic number of finite type-graphs, Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\), The existence of uniquely \(-G\) colourable graphs, The complexity of generalized graph colorings, Degree Ramsey numbers for even cycles, Some recent results on Ramsey-type numbers, Bowtie-free graphs have a Ramsey lift, On globally sparse Ramsey graphs, Chromatic number is Ramsey distinguishing, Reducts of the random bipartite graph, Finding Folkman Numbers via MAX CUT Problem, Ramsey theorem for designs, On some generalized vertex Folkman numbers, Chromatic vertex Folkman numbers, Ramsey Equivalence for Asymmetric Pairs of Graphs, Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, Some remarks on vertex Folkman numbers for hypergraphs, Ramsey-type numbers involving graphs and hypergraphs with large girth, Canonizing structural Ramsey theorems, Simple proof of the existence of restricted Ramsey graphs by means of a partite construction, What is Ramsey-equivalent to a clique?, Unnamed Item, On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers, Nondiversity in substructures, Forcing constructions for uncountably chromatic graphs, Symmetrized induced Ramsey theory, Degree bipartite Ramsey numbers, Online Ramsey Games in Random Graphs, Pre-adjunctions and the Ramsey property, Generalized local colorings of graphs, An algorithmic framework for obtaining lower bounds for random Ramsey problems, An exponential-type upper bound for Folkman numbers, On Ramsey graphs without bipartite subgraphs, A structural generalization of the Ramsey theorem, On the nonexistence of some generalized Folkman numbers, An almost quadratic bound on vertex Folkman numbers, Remarks on generic stability in independent theories, The structure of critical Ramsey graphs, The chromatic number of infinite graphs - A survey, \(p\)-arrangeable graphs are Folkman linear, On Ramsey-type positional games, Partitions of finite relational and set systems, The structure of critical Ramsey graphs, An efficient container lemma, Not all graphs are segment \(T\)-graphs, A note on upper bounds for some generalized Folkman numbers, Conant's generalised metric spaces are Ramsey, My six encounters with Victor Marek---a personal account, On minimal Ramsey graphs and Ramsey equivalence in multiple colours, All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), Planar Ramsey graphs, Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018, Minimal ordered Ramsey graphs, Unnamed Item, On Some Open Questions for Ramsey and Folkman Numbers, The Size Ramsey Number of Graphs with Bounded Treewidth, Sparse Ramsey graphs, On the use of senders in generalized Ramsey theory for graphs, Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques
Cites Work
