New examples of graphs without small cycles and of large size
From MaRDI portal
Publication:1322411
DOI10.1006/eujc.1993.1048zbMath0794.05050OpenAlexW1991809067MaRDI QIDQ1322411
Felix Lazebnik, Vasiliy A. Ustimenko
Publication date: 6 July 1994
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a14c8ed8ad6b60225a8d405c45dec9a4341749c3
Related Items (30)
On the uniqueness of some girth eight algebraically defined graphs ⋮ On the conjecture for the girth of the bipartite graph \(D(k,q)\) ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ Proof of a conjecture on monomial graphs ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ On some cycles in linearized Wenger graphs ⋮ A characterization of the components of the graphs \(D(k,q)\) ⋮ Degree Ramsey numbers for even cycles ⋮ 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 ⋮ A new series of dense graphs of high girth ⋮ On the girth cycles of the bipartite graph \(D(k, q)\) ⋮ On the comparison of cryptographical properties of two different families of graphs with large cycle indicator ⋮ On LDPC codes corresponding to affine parts of generalized polygons ⋮ Spectral and combinatorial properties of some algebraically defined graphs ⋮ Counting polynomials with distinct zeros in finite fields ⋮ On monomial graphs of girth eight ⋮ On some cycles in Wenger graphs ⋮ On the DLW conjectures ⋮ LDPC Codes Based on Algebraic Graphs ⋮ A note on the spectrum of linearized Wenger graphs ⋮ 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 ⋮ On the diameter of Wenger graphs ⋮ Polarities and \(2k\)-cycle-free graphs ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras ⋮ Forbidden induced partial orders ⋮ Linearized Wenger graphs ⋮ Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
This page was built for publication: New examples of graphs without small cycles and of large size
