On the number of pentagons in triangle-free graphs
From MaRDI portal
Publication:1940382
DOI10.1016/j.jcta.2012.12.008zbMath1259.05087arXiv1102.1634OpenAlexW2013425391WikidataQ57601358 ScholiaQ57601358MaRDI QIDQ1940382
Serguei Norine, Alexander A. Razborov, Jan Hladký, Hamed Hatami, Daniel Král'
Publication date: 6 March 2013
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1634
Extremal problems in graph theory (05C35) Quantum groups (quantized enveloping algebras) and related deformations (17B37)
Related Items
Paths of length three are \(K_{r+1}\)-Turán-good, Finitely forcible graph limits are universal, Some exact results for generalized Turán problems, The difference between the metric dimension and the determining number of a graph, Generalized rainbow Turán problems, Multicolor Turán numbers, Generalized Turán number for linear forests, Rainbow triangles in three-colored graphs, The maximum number of paths of length four in a planar graph, Pentagons in triangle-free graphs, Generalized planar Turán numbers, Planar polynomials and an extremal problem of Fischer and Matoušek, The maximum number of cliques in graphs without long cycles, Tropicalization of graph profiles, On supersaturation and stability for generalized Turán problems, Generalized Turán results for intersecting cliques, The maximum number of triangles in \(F_k\)-free graphs, On the maximum number of odd cycles in graphs without smaller odd cycles, The maximum number of paths of length three in a planar graph, Stability version of Dirac's theorem and its applications for generalized Turán problems, Lower Bounds for Maximum Weighted Cut, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, Maximum cliques in a graph without disjoint given subgraph, Every graph is eventually Turán-good, Turán problems for \(k\)-geodetic digraphs, On the Number of Cycles in a Graph with Restricted Cycle Lengths, Generalized Turán problems for even cycles, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Asymptotic Structure of Graphs with the Minimum Number of Triangles, Subgraph densities in \(K_r\)-free graphs, Finitely forcible graphons with an almost arbitrary structure, A new lower bound based on Gromov's method of selecting heavily covered points, Many \(T\) copies in \(H\)-free graphs, Strong forms of stability from flag algebra calculations, The inducibility of blow-up graphs, Simple graph density inequalities with no sum of squares proofs, Maximising the number of cycles in graphs with forbidden subgraphs, Finitely forcible graphons and permutons, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Minimum Number ofk-Cliques in Graphs with Bounded Independence Number, Maximum density of vertex-induced perfect cycles and paths in the hypercube, Induced Turán Numbers, On 3-uniform hypergraphs without a cycle of a given length, Semidefinite Programming and Ramsey Numbers, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, The Inducibility of Graphs on Four Vertices, Counting flags in triangle-free digraphs, Some sharp results on the generalized Turán numbers, On the inducibility of cycles, On Turán-good graphs, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, On the Maximum Quartet Distance between Phylogenetic Trees, Many H-Copies in Graphs with a Forbidden Tree, Many \(T\) copies in \(H\)-free graphs, Generalized Turán number of even linear forests, Maximizing five-cycles in \(K_r\)-free graphs, A problem of Erdős on the minimum number of \(k\)-cliques, Minimizing the number of 5-cycles in graphs with given edge-density, Extensions of the Erdős–Gallai theorem and Luo’s theorem, More about sparse halves in triangle-free graphs, Minimum number of edges that occur in odd cycles, Closing in on Hill's Conjecture, Weak regularity and finitely forcible graph limits, Counting copies of a fixed subgraph in \(F\)-free graphs, Compactness and finite forcibility of graphons, Inducibility of directed paths, Generalized Turán densities in the hypercube, Counting cliques in 1-planar graphs, On the algebraic and topological structure of the set of Turán densities
