Common graphs with arbitrary connectivity and chromatic number

DOI10.1016/j.jctb.2023.06.001zbMath1519.05081arXiv2207.09427OpenAlexW4382645913MaRDI QIDQ6170798

Sejin Ko, Joonkyung Lee

Publication date: 10 August 2023

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

Full work available at URL: https://arxiv.org/abs/2207.09427

zbMATH Keywords

Ramsey multiplicitycommon graphsgraph homomorphism inequalities(hyper)graph connectivity

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Connectivity (05C40)

Related Items (2)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in graphs and functional inequalities
• Connectivity of Cartesian products of graphs
• Multiplicities of subgraphs
• Extremal and Ramsey results on graph blowups
• A correlation inequality for bipartite graphs
• Non-Three-Colourable Common Graphs Exist
• Weak quasi-randomness for uniform hypergraphs
• Recent developments in graph Ramsey theory
• On Sets of Acquaintances and Strangers at any Party
• Sidorenko's conjecture for blow-ups
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On the Ramsey multiplicities of graphs—problems and recent results
• There exist graphs with super‐exponential Ramsey multiplicity constant
• Flag algebras
• On tripartite common graphs

This page was built for publication: Common graphs with arbitrary connectivity and chromatic number