Polarities and \(2k\)-cycle-free graphs
From MaRDI portal
Publication:1292856
DOI10.1016/S0012-365X(99)90107-3zbMath0924.05043OpenAlexW4210755957MaRDI QIDQ1292856
Andrew J. Woldar, Felix Lazebnik, Vasiliy A. Ustimenko
Publication date: 3 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90107-3
Related Items
Graphs without theta subgraphs, Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\), Unnamed Item, On the girth of the bipartite graph \(D(k, q)\), Extremal edge polytopes, On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications, Covering point-sets with parallel hyperplanes and sparse signal recovery, A note on pseudorandom Ramsey graphs, Extremal numbers of hypergraph suspensions of even cycles, Generalized Turán problems for even cycles, A Sequence of Triangle-Free Pseudorandom Graphs, Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, On a conjecture of Erdős and Simonovits: even cycles, Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs, Keyed hash function from large girth expander graphs, General properties of some families of graphs defined by systems of equations, Clumsy packings of graphs, An almost quadratic bound on vertex Folkman numbers, Some constructive bounds on Ramsey numbers, On the Turán number for the hexagon, New Upper Bound on Vertex Folkman Numbers, Multi-color Ramsey numbers of even cycles, A note on the Turán function of even cycles, Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
Cites Work
- Sur la trialité et certains groupes qui s'en déduisent
- Embeddings of small generalized polygons
- On a class of degenerate extremal graph problems
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- On the varieties of parabolic subgroups, their generalizations and combinatorial applications
- The finite Moufang hexagons coordinatized
- Properties of certain families of \(2k\)-cycle-free graphs
- New examples of graphs without small cycles and of large size
- Graphs without quadrilaterals
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- A characterization of the components of the graphs \(D(k,q)\)
- The nonexistence of certain generalized polygons
- Graphs without four-cycles
- A new series of dense graphs of high girth
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item