Toward characterizing locally common graphs
From MaRDI portal
Publication:6077054
DOI10.1002/rsa.21099zbMath1522.05487arXiv2011.02562WikidataQ126176021 ScholiaQ126176021MaRDI QIDQ6077054
Robert Hancock, Matjaž Krnc, Daniel Král', Jan Volec
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.02562
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- Graphs containing triangles are not 3-common
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- Limits of dense graph sequences
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- Graph products and monochromatic multiplicities
- On the local approach to Sidorenko's conjecture
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
- Multiplicities of subgraphs
- Non-bipartite \(k\)-common graphs
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Non-Three-Colourable Common Graphs Exist
- 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
- Some advances on Sidorenko's conjecture
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Flag algebras
- Graph norms and Sidorenko's conjecture
This page was built for publication: Toward characterizing locally common graphs
