Three hundred million points suffice

DOI10.1016/0097-3165(88)90052-0zbMath0676.05001OpenAlexW2088442094MaRDI QIDQ1122573

J. H. Spencer

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(88)90052-0

zbMATH Keywords

monochromatic triangleno complete subgraphs on four or more vertices

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Generalized Ramsey theory (05C55)

Related Items (9)

A Folkman Linear Family ⋮ Globally sparse vertex‐ramsey graphs ⋮ Finding Folkman Numbers via MAX CUT Problem ⋮ On some edge Folkman numbers, small and large ⋮ Unnamed Item ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Regular pairs in sparse random graphs I ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$

Cites Work

• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Vergleich der hypergeometrischen mit der Binomial-Verteilung
• Ramsey theory and Ramsey theoreticians
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three hundred million points suffice