Paths of length four

DOI10.1016/S0012-365X(02)00878-6zbMATH Open1024.05046OpenAlexW2041446452MaRDI QIDQ1874372FDOQ1874372

Authors: Béla Bollobás, Amites Sarkar 

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

Recommendations

• Paths in graphs
• Longest paths and longest cycles in graphs with large degree sums
• scientific article; zbMATH DE number 2188355
• The maximum number of paths of length four in a planar graph
• On the Number of 4-Edge Paths in Graphs With Given Edge Density

zbMATH Keywords

extremal graphspathcomplete bipartite graph

Mathematics Subject Classification ID

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

Cites Work

• Paths in graphs
• Graphs of extremal weights
• Graphs with maximal number of adjacent pairs of edges
• 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
• Title not available (Why is that?)

Cited In (11)

• On the maximum number of copies of H in graphs with given size and order
• On the generalized Wiener polarity index of trees with a given diameter
• Hicas of length \(\leq 4\).
• Results on the Wiener profile
• On the Number of 4-Edge Paths in Graphs With Given Edge Density
• Walks and paths in trees
• The minimum number of detours in graphs
• Title not available (Why is that?)
• A Turán-type problem on distances in graphs
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• Paths in graphs

This page was built for publication: Paths of length four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874372)