Off-diagonal commonality of graphs via entropy

DOI10.1137/23M1625342zbMATH Open1546.05096MaRDI QIDQ6594391

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

Publication date: 28 August 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey theoryhomomorphismoff-diagonalcommon graphSidorenko

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monochromatic triangles in three-coloured graphs
• The homomorphism domination exponent
• Limits of dense graph sequences
• Multiplicities of subgraphs
• Non-bipartite \(k\)-common graphs
• A path forward: tropicalization in extremal combinatorics
• Finite reflection groups and graph norms
• A correlation inequality for bipartite graphs
• Non-Three-Colourable Common Graphs Exist
• Recent developments in graph Ramsey theory
• On Sets of Acquaintances and Strangers at any Party
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On the Ramsey multiplicities of graphs—problems and recent results
• Some advances on Sidorenko's conjecture
• On tripartite common graphs
• On some graph densities in locally dense graphs
• A Property on Monochromatic Copies of Graphs Containing a Triangle
• Common graphs with arbitrary connectivity and chromatic number
• Extended commonality of paths and cycles via Schur convexity

This page was built for publication: Off-diagonal commonality of graphs via entropy

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