Generalized Turán problems for complete bipartite graphs

DOI10.1007/S00373-022-02570-3MaRDI QIDQ2084784zbMATH OpenOpenAlexFDO

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

Publication date 13 October 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

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)

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.

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

Cites work

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

Cited in

(13)

• Extremal problems of double stars
• Regular Turán numbers of complete bipartite graphs
• Generalized Turán problems for double stars
• 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)