Graphs without theta subgraphs

DOI10.1016/j.jctb.2018.05.003zbMath1402.05118OpenAlexW2809162135WikidataQ129628227 ScholiaQ129628227MaRDI QIDQ1633744

Jason S. Williford, Jacques Verstraete

Publication date: 20 December 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2018.05.003

zbMATH Keywords

finite fieldsextremal graphsTurán numbers\(\theta\) graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size ⋮ Graphs with few paths of prescribed length between any two vertices ⋮ On the Turán Number of Generalized Theta Graphs ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Unnamed Item ⋮ More on the extremal number of subdivisions ⋮ On the rational Turán exponents conjecture ⋮ On the Turán number of theta graphs ⋮ Extremal Numbers of Cycles Revisited ⋮ Turán numbers of theta graphs

Uses Software

• Magma

Cites Work

• On the spectrum of Wenger graphs
• The existence of even cycles with specific lengths in Wenger's graph
• On a class of degenerate extremal graph problems
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Polarities and \(2k\)-cycle-free graphs
• The Magma algebra system. I: The user language
• New upper bounds on the order of cages
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• On the Turán number for the hexagon
• Constructions of bipartite graphs from finite geometries
• Graphs with few paths of prescribed length between any two vertices
• A Bound on the Number of Edges in Graphs Without an Even Cycle
• On the structure of linear graphs