Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
From MaRDI portal
Publication:1869034
DOI10.1016/S0195-6698(02)00119-1zbMath1014.05038OpenAlexW2022459377MaRDI QIDQ1869034
Vasiliy A. Ustimenko, Andrew J. Woldar
Publication date: 9 April 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(02)00119-1
filtrationgirthfree productbidegreebipartite biregular graphaffine \(m\)-gongeneralized \(m\)-gongroup rainbow graphunipotent-like factorization
Extremal problems in graph theory (05C35) Other designs, configurations (05B30) General block designs in finite geometry (51E05)
Related Items (7)
On the conjecture for the girth of the bipartite graph \(D(k,q)\) ⋮ Girth of the algebraic bipartite graph \(D(k,q)\) ⋮ On the girth cycles of the bipartite graph \(D(k, q)\) ⋮ Performance of algebraic graphs based stream-ciphers using large finite fields ⋮ On LDPC codes corresponding to affine parts of generalized polygons ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
Cites Work
- Unnamed Item
- Unnamed Item
- On a class of degenerate extremal graph problems
- Buildings of spherical type and finite BN-pairs
- New examples of graphs without small cycles and of large size
- New upper bounds on the order of cages
- Cycles of even length in graphs
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- Explicit construction of graphs with an arbitrary large girth and of large size
- Graphs of prescribed girth and bi-degree
- A characterization of the components of the graphs \(D(k,q)\)
- A new series of dense graphs of high girth
This page was built for publication: Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations