A Ramsey type problem concerning vertex colourings

DOI10.1016/0095-8956(91)90089-3zbMath0686.05039OpenAlexW1989534282MaRDI QIDQ1262327

Vojtěch Rödl, Jason I. Brown

Publication date: 1991

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(91)90089-3

zbMATH Keywords

Ramsey theoryvertex partitionFolkman graph

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

The vertex size-Ramsey number, The minimum independence number for designs, The existence of uniquely \(-G\) colourable graphs, The complexity of generalized graph colorings, The asymptotics of \(r(4,t)\), Some remarks on vertex Folkman numbers for hypergraphs, On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers, An almost quadratic bound on vertex Folkman numbers, New Upper Bound on Vertex Folkman Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• A Ramsey theoretic problem for finite ordered sets
• Expanding graphs contain all small trees
• The number of submatrices of a given type in a Hadamard matrix and related results
• Selective Graphs and Hypergraphs
• On size Ramsey number of paths, trees, and circuits. I
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring