Graphs without theta subgraphs
DOI10.1016/J.JCTB.2018.05.003zbMATH Open1402.05118OpenAlexW2809162135WikidataQ129628227 ScholiaQ129628227MaRDI QIDQ1633744FDOQ1633744
Authors: J. Verstraëte, Jason S. Williford 
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
Recommendations
- Graphs without large triangle free subgraphs
- Graphs without minor complete subgraphs
- Triangle-free graphs without forbidden subgraphs
- scientific article; zbMATH DE number 3880746
- On Graphs that do not Contain a Thomsen Graph
- The typical structure of graphs without given excluded subgraphs
- scientific article; zbMATH DE number 5917767
- Graphs without four-cycles
- scientific article; zbMATH DE number 4139791
extremal graphsfinite fields[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+numbers&go=Go Tur��n numbers]\(\theta\) graphs
Cites Work
- The Magma algebra system. I: The user language
- On the structure of linear graphs
- Cycles of even length in graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Compactness results in extremal graph theory
- On the Turán number for the hexagon
- New upper bounds on the order of cages
- Polarities and \(2k\)-cycle-free graphs
- On the spectrum of Wenger graphs
- Constructions of bipartite graphs from finite geometries
- The existence of even cycles with specific lengths in Wenger's graph
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- On a class of degenerate extremal graph problems
- Graphs with few paths of prescribed length between any two vertices
Cited In (18)
- Graphs with few paths of prescribed length between any two vertices
- Title not available (Why is that?)
- Turán numbers of theta graphs
- On Graphs that do not Contain a Thomsen Graph
- On the rational Turán exponents conjecture
- More on the extremal number of subdivisions
- Some sharp lower bounds for the bipartite Turán number of theta graphs
- Excluding a large theta graph
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- On the Turán number of theta graphs
- Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
- Extremal numbers of cycles revisited
- Extremal Theta-free planar graphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Title not available (Why is that?)
- A polynomial resultant approach to algebraic constructions of extremal graphs
- On the Turán Number of Generalized Theta Graphs
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
Uses Software
This page was built for publication: Graphs without theta subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633744)
