A Property on Monochromatic Copies of Graphs Containing a Triangle
From MaRDI portal
Publication:6141863
DOI10.1137/23m1564894arXiv2304.04601OpenAlexW4390814468WikidataQ130129134 ScholiaQ130129134MaRDI QIDQ6141863
No author found.
Publication date: 23 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.04601
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- 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
- Cycles in graphs and functional inequalities
- On the local approach to Sidorenko's conjecture
- Multiplicities of subgraphs
- Convex graphon parameters and graph norms
- 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
- Inequalities for functionals generated by bipartite graphs
- Some advances on Sidorenko's conjecture
- There exist graphs with super‐exponential Ramsey multiplicity constant
- On tripartite common graphs
- Graph norms and Sidorenko's conjecture
- Locally common graphs
- Toward characterizing locally common graphs
- Common graphs with arbitrary connectivity and chromatic number
This page was built for publication: A Property on Monochromatic Copies of Graphs Containing a Triangle
