Common pairs of graphs

DOI10.1017/S0963548325000094MaRDI QIDQ6879463zbMATH OpenFDO

Authors Natalie C. Behague, Natasha Morrison, Jonathan A. Noel

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548325000094

zbMATH Keywords

common graphsextremal graph theoryflag algebrasgraph limitsquasirandomnessRamsey multiplicityRamsey theorySidorenko's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A correlation inequality for bipartite graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A note on the inducibility of 4-vertex graphs
• An approximate version of Sidorenko's conjecture
• Analytic Inequalities
• Common and Sidorenko equations in abelian groups
• Common and Sidorenko linear equations
• Common graphs with arbitrary connectivity and chromatic number
• Finite reflection groups and graph norms
• Flag algebras
• Graph norms and Sidorenko's conjecture
• Graph products and monochromatic multiplicities
• Graphs containing triangles are not 3-common
• 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
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Locally common graphs
• Multiplicities of subgraphs
• New Ramsey multiplicity bounds and search heuristics
• Non-bipartite \(k\)-common graphs
• Non-three-colourable common graphs exist
• Off-diagonal commonality of graphs via entropy
• On a problem of formal logic.
• On Sets of Acquaintances and Strangers at any Party
• On the Ramsey multiplicities of graphs—problems and recent results
• On the Ramsey multiplicity of complete graphs
• On tripartite common graphs
• On uncommon systems of equations
• Ramsey multiplicity and the Turán coloring
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• 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
• There exist graphs with super‐exponential Ramsey multiplicity constant
• Toward characterizing locally common graphs
• Two approaches to Sidorenko's conjecture

Cited in

(1)

• Disconnected common graphs via supersaturation

This page was built for publication: Common pairs of graphs

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