On the maximum number of five-cycles in a triangle-free graph
From MaRDI portal
Publication:713972
DOI10.1016/j.jctb.2012.04.001zbMath1252.05093arXiv1102.0962MaRDI QIDQ713972
Publication date: 19 October 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.0962
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05A16: Asymptotic enumeration
03C13: Model theory of finite structures
05C42: Density (toughness, etc.)
Related Items
Weak regularity and finitely forcible graph limits, On the Number of Cycles in a Graph with Restricted Cycle Lengths, Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, A New Bound for the 2/3 Conjecture, Finitely forcible graphons with an almost arbitrary structure, Many H-Copies in Graphs with a Forbidden Tree, Minimizing the number of 5-cycles in graphs with given edge-density, Extensions of the Erdős–Gallai theorem and Luo’s theorem, Minimum Number of Monotone Subsequences of Length 4 in Permutations, The Inducibility of Graphs on Four Vertices, Counting flags in triangle-free digraphs, On the inducibility of cycles, Many \(T\) copies in \(H\)-free graphs, On the algebraic and topological structure of the set of Turán densities, Finitely forcible graphons and permutons, On 3-uniform hypergraphs without a cycle of a given length, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, A problem of Erdős on the minimum number of \(k\)-cliques, Inducibility of directed paths, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, Finitely forcible graph limits are universal, Pentagons in triangle-free graphs, Planar polynomials and an extremal problem of Fischer and Matoušek, The maximum number of cliques in graphs without long cycles, Strong forms of stability from flag algebra calculations, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, Maximum density of vertex-induced perfect cycles and paths in the hypercube, Some sharp results on the generalized Turán numbers, On Turán-good graphs, Generalized Turán number of even linear forests, Maximizing five-cycles in \(K_r\)-free graphs, Generalized Turán problems for even cycles, Maximising the number of cycles in graphs with forbidden subgraphs, The shifting method and generalized Turán number of matchings, Minimum number of edges that occur in odd cycles, Counting copies of a fixed subgraph in \(F\)-free graphs, Compactness and finite forcibility of graphons, Rainbow triangles in three-colored graphs, Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, The maximum number of paths of length four in a planar graph, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
