Common graphs with arbitrary chromatic number

DOI10.1112/S0010437X24007681MaRDI QIDQ6952570zbMATH OpenFDO

Authors Daniel Král', Jan Volec, Fan Wei

Publication date 27 July 2025

Published in Compositio Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/S0010437X24007681

zbMATH Keywords

chromatic numbergraph limitsprobabilistic methodRamsey theoryspectral method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cites work

• A correlation inequality for bipartite graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• A new upper bound for diagonal Ramsey numbers
• An approximate version of Sidorenko's conjecture
• Common graphs with arbitrary connectivity and chromatic number
• Counting odd cycles in locally dense graphs
• Diagonal Ramsey via effective quasirandomness
• Finite reflection groups and graph norms
• Finite sums from sequences within cells of a partition of N
• Finitely forcible graph limits are universal
• Flag algebras
• Graph norms and Sidorenko's conjecture
• Graph Theory and Probability
• scientific article; zbMATH DE number 4216032 (Why is no real title available?)
• scientific article; zbMATH DE number 4135981 (Why is no real title available?)
• scientific article; zbMATH DE number 903461 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Large networks and graph limits
• Locally common graphs
• Multiplicities of subgraphs
• Non-bipartite \(k\)-common graphs
• Non-three-colourable common graphs exist
• On a problem of formal logic.
• On Sets of Acquaintances and Strangers at any Party
• On sets of integers containing k elements in arithmetic progression
• On some graph densities in locally dense graphs
• On the local approach to Sidorenko's conjecture
• On the Ramsey multiplicities of graphs—problems and recent results
• On tripartite common graphs
• Recent developments in graph Ramsey theory
• Sidorenko's conjecture for blow-ups
• Some advances on Sidorenko's conjecture
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Supersaturated graphs and hypergraphs
• The minimum number of subgraphs in a graph and its complement
• The probabilistic method
• There exist graphs with super‐exponential Ramsey multiplicity constant
• Toward characterizing locally common graphs
• Weak hypergraph regularity and linear hypergraphs

Cited in

(1)

• Disconnected common graphs via supersaturation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952570)