On the Number of 4-Edge Paths in Graphs With Given Edge Density

DOI10.1017/S0963548316000389zbMath1371.05130OpenAlexW2561562985MaRDI QIDQ5366950

Dániel T. Nagy

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548316000389

zbMATH Keywords

quasi-star\(k\)-edge starsquasi-clique graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Related Items

Results on the Wiener profile ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ The number of $4$-cycles and the cyclomatic number of a finite simple graph ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ On a Conjecture of Nagy on Extremal Densities

Cites Work

• Unnamed Item
• Unnamed Item
• The clique density theorem
• On the number of certain subgraphs contained in graphs with a given number of edges
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• Paths of length four
• Multipodal structure and phase transitions in large constrained graphs
• The number of cliques in graphs of given order and size
• On the Minimal Density of Triangles in Graphs
• Graphs with maximal number of adjacent pairs of edges
• Paths in graphs