The number of copies of K₂,t+1 in a graph

DOI10.1007/S00373-022-02536-5zbMATH Open1495.05134OpenAlexW4290861005MaRDI QIDQ2164991FDOQ2164991

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) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

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

Cited In (3)

• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• On the number of copies of one hypergraph in another
• On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory

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

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