Supersaturation problem for the bowtie
From MaRDI portal
Publication:5915823
DOI10.1016/j.endm.2017.07.023zbMath1379.05063arXiv1710.01471OpenAlexW2963002296MaRDI QIDQ5915823
Mihyun Kang, Tamás Makai, Oleg Pikhurko
Publication date: 18 January 2018
Published in: Electronic Notes in Discrete Mathematics, European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.01471
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Spectral extremal graphs for the bowtie, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Stability Results for Two Classes of Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique density theorem
- Supersaturation problem for color-critical graphs
- An approximate version of Sidorenko's conjecture
- A theorem on flows in networks
- On a theorem of Rademacher-Turán
- Supersaturated graphs and hypergraphs
- Universal graphs with forbidden subgraphs and algebraic closure
- Extremal graphs for intersecting triangles
- Extremal graphs for blow-ups of cycles and trees
- Counting substructures. I: Color critical graphs
- A correlation inequality for bipartite graphs
- Bowtie-free graphs have a Ramsey lift
- Two approaches to Sidorenko’s conjecture
- The number of cliques in graphs of given order and size
- Combinatorial Properties of Matrices of Zeros and Ones
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- Lower bounds on the number of triangles in a graph
- Triangles in an Ordinary Graph
- Some remarks on universal graphs
- Graph norms and Sidorenko's conjecture
