On the Number of 4-Edge Paths in Graphs With Given Edge Density
From MaRDI portal
Recommendations
- On the edge-density of 4-critical graphs
- The edge density of 4-critical planar graphs
- The edge-density of 4-critical planar graphs
- On the number of 4-contractible edges in 4-connected graphs
- On the number of K₄-saturating edges
- On 4-critical planar graphs with high edge density
- The maximum number of paths of length four in a planar graph
- On the number of all substructures containing at most four edges
- scientific article; zbMATH DE number 1536527
Cites work
- Graphs with maximal number of adjacent pairs of edges
- scientific article; zbMATH DE number 4137789 (Why is no real title available?)
- Large networks and graph limits
- Multipodal structure and phase transitions in large constrained graphs
- On the Minimal Density of Triangles in Graphs
- 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 in graphs
- Paths of length four
- The clique density theorem
- The number of cliques in graphs of given order and size
Cited in
(11)- Results on the Wiener profile
- Paths of length four
- Unified approach to the generalized Turán problem and supersaturation
- The maximum number of paths of length four in a planar graph
- Paths in graphs
- The number of 4-cycles and the cyclomatic number of a finite simple graph
- On a conjecture of Nagy on extremal densities
- On the maximum number of copies of H in graphs with given size and order
- On the edge-density of 4-critical graphs
- Threshold graphs maximise homomorphism densities
- Getting to the root of the problem: sums of squares for limits of trees
This page was built for publication: On the Number of 4-Edge Paths in Graphs With Given Edge Density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366950)
