The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths

DOI10.37236/10178zbMath1476.05091OpenAlexW3206184286MaRDI QIDQ2236805

Yanyan Li

Publication date: 26 October 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/10178

zbMATH Keywords

complete bipartite graphgeneralized Turán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (3)

The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ A note on maximum size of a graph without isolated vertices under the given matching number ⋮ Further results on the generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Connected graphs without long paths
• The maximum number of cliques in graphs without long cycles
• Some sharp results on the generalized Turán numbers
• Generalized Turán problems for even cycles
• The shifting method and generalized Turán number of matchings
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• On maximal paths and circuits of graphs
• A Generalized Turán Problem and its Applications
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths