Counting cliques without generalized theta graphs

DOI10.1002/JGT.70001MaRDI QIDQ6854968zbMATH OpenFDO

Authors Jun Gao, Zhuo Wu, Yi-Sai Xue

Publication date 23 February 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.70001

zbMATH Keywords

book graphTurán number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cites work

• A generalized Turán problem and its applications
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Counting triangles in graphs without vertex disjoint odd cycles
• Generalized Turán problems for disjoint copies of graphs
• Generalized Turán problems for even cycles
• Graphs with few paths of prescribed length between any two vertices
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Many \(T\) copies in \(H\)-free graphs
• Maximum cliques in a graph without disjoint given subgraph
• On 3-uniform hypergraphs without a cycle of a given length
• On a class of degenerate extremal graph problems
• On a problem of K. Zarankiewicz
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On the combinatorial problems which I would most like to see solved
• On the generalized Turán problem for odd cycles
• On the Turán Number of Generalized Theta Graphs
• The number of labeled k-dimensional trees
• Turán numbers of theta graphs

Cited in

(1)

• Turán problem for Berge disjoint cycles in hypergraphs

This page was built for publication: Counting cliques without generalized theta graphs

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