The number of copies of \(K_{2,t+1}\) in a graph

DOI10.1007/s00373-022-02536-5zbMath1495.05134OpenAlexW4290861005MaRDI QIDQ2164991

Han Ren, Ting Li

Publication date: 18 August 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02536-5

zbMATH Keywords

complete bipartite graphsTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• On complete subgraphs of \(r\)-chromatic graphs
• Norm-graphs: Variations and applications
• Graphs without quadrilaterals
• New asymptotics for bipartite Turán numbers
• Norm-graphs and bipartite Turán numbers
• The number of 4-cycles in a graph
• Über ein Problem von K. Zarankiewicz
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of copies of \(K_{2,t+1}\) in a graph