An exponential-type upper bound for Folkman numbers
From MaRDI portal
Publication:681604
DOI10.1007/s00493-015-3298-1zbMath1413.05371arXiv1603.00521OpenAlexW3103996987WikidataQ115606572 ScholiaQ115606572MaRDI QIDQ681604
Andrzej Ruciński, Mathias Schachtz, Vojtěch Rödl
Publication date: 12 February 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00521
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Ramsey theory (05D10)
Related Items (6)
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ A Note on Induced Ramsey Numbers ⋮ Ramsey-type numbers involving graphs and hypergraphs with large girth ⋮ On the number of points in general position in the plane ⋮ An efficient container lemma ⋮ A note on upper bounds for some generalized Folkman numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial theorems in sparse random sets
- Some remarks on vertex Folkman numbers for hypergraphs
- Hypergraph containers
- An almost quadratic bound on vertex Folkman numbers
- The Ramsey property for graphs with forbidden complete subgraphs
- Ramsey properties of random hypergraphs
- Ramsey properties of random graphs and folkman numbers
- Introduction to Random Graphs
- Ramsey properties of random discrete structures
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
- On the Folkman Numberf(2, 3, 4)
- Computation of the Folkman numberFe(3, 3; 5)
- Remarks on 15-vertex (3,3)-Ramsey graphs not containing K_5
- Ein kombinatorischer Satz mit Anwendung auf ein logisches Entscheidungsproblem
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
- A Short Proof of the Random Ramsey Theorem
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
This page was built for publication: An exponential-type upper bound for Folkman numbers
