Generalized Turán problems for complete bipartite graphs

DOI10.1007/S00373-022-02570-3zbMATH Open1498.05133arXiv2101.08094OpenAlexW4297088897MaRDI QIDQ2084784FDOQ2084784

Authors: Dániel Gerbner, Balázs Patkós 

Publication date: 13 October 2022

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

Abstract: For graph $G$, $F$ and integer $n$, the generalized Tu'an number $ex(n,G,F)$ denotes the maximum number of copies of $G$ that an $F$-free $n$-vertex graph can have. We study this parameter when both $G$ and $F$ are complete bipartite graphs.

Full work available at URL: https://arxiv.org/abs/2101.08094

Recommendations

• Generalized Turán problems for disjoint copies of graphs
• Generalized Turán problems for \(K_{2,t}\)
• On generalized Turán number of two disjoint cliques
• Some sharp results on the generalized Turán numbers
• The generalized Turán number of spanning linear forests

zbMATH Keywords

extremal graph theorycomplete bipartite graphsstability resultsgeneralized Turán problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Norm-graphs and bipartite Turán numbers
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• Solving a linear equation in a set of integers I
• Norm-graphs: Variations and applications
• New asymptotics for bipartite Turán numbers
• An Upper Bound on Zarankiewicz' Problem
• Title not available (Why is that?)
• On hypergraphs of girth five
• Hypergraphs with no cycle of a given length
• A counterexample to sparse removal
• Extremal results for Berge hypergraphs
• Many \(T\) copies in \(H\)-free graphs
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• Some extremal results on complete degenerate hypergraphs
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• Random algebraic construction of extremal graphs
• A survey of Turán problems for expansions
• Generalized Turán problems for even cycles
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Unified approach to the generalized Turán problem and supersaturation

Cited In (13)

• Extremal problems of double stars
• Generalized Turán problems for double stars
• Regular Turán numbers of complete bipartite graphs
• Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
• On generalized Turán number of two disjoint cliques
• The shifting method and generalized Turán number of matchings
• Turán function and \(H\)-decomposition problem for gem graphs
• Generalized Turán problems for disjoint copies of graphs
• On the extremal graphs in generalized Tur\'an problems
• Generalized Turán problems for \(K_{2,t}\)
• Generalized Turán numbers for the edge blow-up of a graph
• Some Stability and Exact Results in Generalized Turán Problems
• The generalized Turán number of spanning linear forests

This page was built for publication: Generalized Turán problems for complete bipartite graphs

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