Graphs without theta subgraphs
From MaRDI portal
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
Cites work
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Compactness results in extremal graph theory
- Constructions of bipartite graphs from finite geometries
- Cycles of even length in graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Graphs with few paths of prescribed length between any two vertices
- New upper bounds on the order of cages
- On a class of degenerate extremal graph problems
- On the spectrum of Wenger graphs
- On the structure of linear graphs
- On the Turán number for the hexagon
- Polarities and \(2k\)-cycle-free graphs
- The existence of even cycles with specific lengths in Wenger's graph
- The Magma algebra system. I: The user language
Cited in
(22)- On the rational Turán exponents conjecture
- On the Turán number of theta graphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- More on the extremal number of subdivisions
- Extremal Theta-free planar graphs
- scientific article; zbMATH DE number 3880746 (Why is no real title available?)
- scientific article; zbMATH DE number 2028650 (Why is no real title available?)
- Extremal numbers of cycles revisited
- Turán numbers of theta graphs
- Graphs with few paths of prescribed length between any two vertices
- On Graphs that do not Contain a Thomsen Graph
- 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
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- On the Turán Number of Generalized Theta Graphs
- Some sharp lower bounds for the bipartite Turán number of theta graphs
- A polynomial resultant approach to algebraic constructions of extremal graphs
- Forbidden subgraphs and complete partitions
- Clique supersaturation
- Polynomial resultants and Ramsey numbers of a theta graph
- Excluding a large theta graph
- Non-bipartite graphs without theta subgraphs
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)
