Supersaturation of odd linear cycles

DOI10.37236/14165MaRDI QIDQ7307893zbMATH OpenFDO

Authors Lirong Deng, Jie Han, Jiaxi Nie, Sam Spiro

Publication date 3 August 2026

Published in (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/14165

Mathematics Subject Classification ID

No records found.

Cites work

• A correlation inequality for bipartite graphs
• An approximate version of Sidorenko's conjecture
• Compactness results in extremal graph theory
• Correction to: ``Extremal numbers and Sidorenko's conjecture
• Counting substructures. I: Color critical graphs
• Finite reflection groups and graph norms
• Flag algebras
• Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
• Graph norms and Sidorenko's conjecture
• scientific article; zbMATH DE number 3885945 (Why is no real title available?)
• scientific article; zbMATH DE number 4216032 (Why is no real title available?)
• scientific article; zbMATH DE number 3821782 (Why is no real title available?)
• scientific article; zbMATH DE number 3900799 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• Large networks and graph limits
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Many pentagons in triple systems
• On coloring graphs to maximize the proportion of multicolored k-edges
• On hypergraphs of girth five
• On the local approach to Sidorenko's conjecture
• On the Minimal Density of Triangles in Graphs
• Sidorenko hypergraphs and random Turán numbers
• Sidorenko's conjecture for blow-ups
• Some advances on Sidorenko's conjecture
• Sparse hypergraphs with applications to coding theory
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Supersaturated graphs and hypergraphs
• Supersaturation beyond color-critical graphs
• Supersaturation of even linear cycles in linear hypergraphs
• Supersaturation problem for color-critical graphs
• The clique density theorem
• The exact minimum number of triangles in graphs with given order and size
• The number of \(C_{2\ell}\)-free graphs
• The number of cliques in graphs of given order and size
• The number of hypergraphs without linear cycles
• Triangle-free subgraphs of hypergraphs
• Triforce and corners
• Turán theorems for even cycles in random hypergraph
• Two approaches to Sidorenko's conjecture

This page was built for publication: Supersaturation of odd linear cycles

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