Paths of length four

DOI10.1016/S0012-365X(02)00878-6zbMath1024.05046OpenAlexW2041446452MaRDI QIDQ1874372

Amites Sarkar, Béla Bollobás

Publication date: 25 May 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00878-6

zbMATH Keywords

extremal graphscomplete bipartite graphpath

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Walks and paths in trees ⋮ A Turán-type problem on distances in graphs ⋮ Results on the Wiener profile ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ On the Number of 4-Edge Paths in Graphs With Given Edge Density ⋮ The number of $4$-cycles and the cyclomatic number of a finite simple graph ⋮ On the generalized Wiener polarity index of trees with a given diameter

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Rearrangements of \((0,-1)\) matrices
• Graphs with maximal number of adjacent pairs of edges
• Paths in graphs

This page was built for publication: Paths of length four