Disconnected common graphs via supersaturation

DOI10.37236/12664MaRDI QIDQ7234736zbMATH OpenFDO

Authors J. B. Lee, Jonathan A. Noel

Publication date 29 April 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12664

zbMATH Keywords

monochromatic labelled copies

Mathematics Subject Classification ID

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

Cites work

• A correlation inequality for bipartite graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A path forward: tropicalization in extremal combinatorics
• A Property on Monochromatic Copies of Graphs Containing a Triangle
• An approximate version of Sidorenko's conjecture
• Analytic Inequalities
• Clique polynomials have a unique root of smallest modulus
• Common graphs with arbitrary chromatic number
• Common graphs with arbitrary connectivity and chromatic number
• Common pairs of graphs
• Extended commonality of paths and cycles via Schur convexity
• Finite reflection groups and graph norms
• Flag algebras
• Graph norms and Sidorenko's conjecture
• Graphs containing triangles are not 3-common
• scientific article; zbMATH DE number 4135981 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3508542 (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
• Lower bounds on the number of triangles in a graph
• Minimizing the number of 5-cycles in graphs with given edge-density
• Multiplicities of subgraphs
• Non-bipartite \(k\)-common graphs
• Non-three-colourable common graphs exist
• Off-diagonal commonality of graphs via entropy
• On Sets of Acquaintances and Strangers at any Party
• On some graph densities in locally dense graphs
• On the Minimal Density of Triangles in Graphs
• On the Ramsey multiplicities of graphs—problems and recent results
• On tripartite common graphs
• Positive graphs
• Ramsey multiplicity and the Turán coloring
• Ramsey's theorem - a new lower bound
• Sidorenko's conjecture for blow-ups
• Some advances on Sidorenko's conjecture
• Some remarks on the theory of graphs
• Toward characterizing locally common graphs
• Two approaches to Sidorenko's conjecture

This page was built for publication: Disconnected common graphs via supersaturation

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