A new series of dense graphs of high girth
From MaRDI portal
Publication:4320744
DOI10.1090/S0273-0979-1995-00569-0zbMath0822.05039arXivmath/9501231MaRDI QIDQ4320744
Felix Lazebnik, Andrew J. Woldar, Vasiliy A. Ustimenko
Publication date: 5 October 1995
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9501231
bipartite graphs; girth; lower bounds; edge-transitive graph; number of edges; dense graphs; degenerate Turán type extremal problem
Related Items
Unnamed Item, Boundary Properties of Factorial Classes of Graphs, On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2, The structure and the number of \(P_7\)-free bipartite graphs, On the conjecture for the girth of the bipartite graph \(D(k,q)\), Proof of a conjecture on monomial graphs, On the girth of the bipartite graph \(D(k, q)\), On regular hypergraphs of high girth, Degrees of nonlinearity in forbidden 0-1 matrix problems, Locally bounded coverings and factorial properties of graphs, A tournament approach to pattern avoiding matrices, Boundary properties of graphs for algorithmic graph problems, New results on EX graphs, New families of graphs without short cycles and large size, On an extremal hypergraph problem related to combinatorial batch codes, Recent developments on graphs of bounded clique-width, On the homogeneous algebraic graphs of large girth and their applications, Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\), Minimum cuts, girth and a spectral threshold, Polarities and \(2k\)-cycle-free graphs, Finite fields and Ramanujan graphs, On the connectivity of certain graphs of high girth., Wavelength routing in optical networks of diameter two, Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations, A characterization of the components of the graphs \(D(k,q)\), On families of graphs of large cycle indicator, matrices of large order and key exchange protocols with nonlinear polynomial maps of small degree, On the comparison of cryptographical properties of two different families of graphs with large cycle indicator, The cardinality of sets of \(k\)-independent vectors over finite fields, Degree Ramsey numbers for even cycles, On a conjecture of Erdős and Simonovits: even cycles, The implementation of cubic public keys based on a new family of algebraic graphs, On LDPC codes corresponding to affine parts of generalized polygons, Multi-color Ramsey numbers of even cycles, A hierarchy of randomness for graphs, On small world semiplanes with generalised Schubert cells, General properties of some families of graphs defined by systems of equations, Colouring and Covering Nowhere Dense Graphs, On Extremal Graphs with Bounded Girth, On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition, On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications, ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE, On the girth of random Cayley graphs, Turán problems for integer-weighted graphs, Girth of sparse graphs
Cites Work
- Explicit construction of regular graphs without small cycles
- A linear interpretation of the flag geometries of Chevalley groups
- Note on the girth of Ramanujan graphs
- On a class of degenerate extremal graph problems
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Properties of certain families of \(2k\)-cycle-free graphs
- New examples of graphs without small cycles and of large size
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Graphs of prescribed girth and bi-degree
- Minimal Regular Graphs of Girths Eight and Twelve
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
