Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
From MaRDI portal
Publication:1179469
DOI10.1016/0095-8956(91)90097-4zbMath0755.05060OpenAlexW181128013MaRDI QIDQ1179469
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90097-4
Related Items (60)
On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ On the conjecture for the girth of the bipartite graph \(D(k,q)\) ⋮ Graphs without theta subgraphs ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ Generalized rainbow Turán problems ⋮ Spanners for bounded tree-length graphs ⋮ On small world semiplanes with generalised Schubert cells ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ On some cycles in linearized Wenger graphs ⋮ Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ Forbidding multiple copies of forestable graphs ⋮ On the girth of the bipartite graph \(D(k, q)\) ⋮ Girth of the algebraic bipartite graph \(D(k,q)\) ⋮ On the spectrum of Wenger graphs ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ A new series of dense graphs of high girth ⋮ On the girth cycles of the bipartite graph \(D(k, q)\) ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ On sparse parity check matrices (extended abstract) ⋮ Graphs with few paths of prescribed length between any two vertices ⋮ On the Turán Number of Generalized Theta Graphs ⋮ Unnamed Item ⋮ Multicolor Ramsey numbers of bipartite graphs and large books ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ Generalized Turán problems for even cycles ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ Fast deterministic distributed algorithms for sparse spanners ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Graphs without cycles of even length ⋮ Some structural properties of low-rank matrices related to computational complexity ⋮ The existence of even cycles with specific lengths in Wenger's graph ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Counting polynomials with distinct zeros in finite fields ⋮ On monomial graphs of girth eight ⋮ Bipartite algebraic graphs without quadrilaterals ⋮ On some cycles in Wenger graphs ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ A note on the spectrum of linearized Wenger graphs ⋮ Cycles in graphs of fixed girth with large size ⋮ A construction for infinite families of semisymmetric graphs revealing their full automorphism group ⋮ General properties of some families of graphs defined by systems of equations ⋮ Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners ⋮ Unnamed Item ⋮ Graph spanners: a tutorial review ⋮ Multi-color Ramsey numbers of even cycles ⋮ On the diameter of Wenger graphs ⋮ Distributed algorithms for ultrasparse spanners and linear size skeletons ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ Distance-Preserving Graph Contractions ⋮ Extremal Numbers of Cycles Revisited ⋮ Turán numbers of theta graphs ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ A note on the Turán function of even cycles ⋮ Distance-Preserving Graph Contractions ⋮ Linearized Wenger graphs ⋮ Density of balanced 3-partite graphs without 3-cycles or 4-cycles ⋮ Turán problems for integer-weighted graphs
Cites Work
This page was built for publication: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
