Counting multiple graphs in generalized Turán problems

MaRDI QIDQ6913076zbMATH OpenFDO

Authors Dániel Gerbner

Publication date 21 October 2025

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/92/ajc_v92_p244.pdf

zbMATH Keywords

Berge hypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cites work

• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• A hypergraph extension of Turán's theorem
• A Remark on the Number of Complete and Empty Subgraphs
• A survey of Turán problems for expansions
• A Turán type problem concerning the powers of the degrees of a graph
• Avoiding long Berge cycles
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• Bounds for Zagreb indices
• Counting copies of a fixed subgraph in F-free graphs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Extremal graphs for intersecting triangles
• Extremal results for Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• Generalized Turán problems for disjoint copies of graphs
• Generalized Turán problems for small graphs
• scientific article; zbMATH DE number 3691361 (Why is no real title available?)
• scientific article; zbMATH DE number 3523543 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Many \(T\) copies in \(H\)-free graphs
• Maximising the number of cycles in graphs with forbidden subgraphs
• On 3-uniform hypergraphs without a cycle of a given length
• On a valence problem in extremal graph theory
• On complete subgraphs of different orders
• On degree powers and counting stars in F-free graphs
• On maximal paths and circuits of graphs
• On non-degenerate Berge-Turán problems
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the maximum number of five-cycles in a triangle-free graph
• On the number of pentagons in triangle-free graphs
• Pentagons vs. triangles
• Some exact results for generalized Turán problems
• Some sharp results on the generalized Turán numbers
• Stability from graph symmetrization arguments in generalized Turán problems
• The Erdős‐Sós Conjecture for trees of diameter four
• The inducibility of complete bipartite graphs
• The maximum number of triangles in a graph of given maximum degree

This page was built for publication: Counting multiple graphs in generalized Turán problems

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