On some cycles in Wenger graphs
From MaRDI portal
Publication:1987600
DOI10.1007/s10255-020-0927-2zbMath1437.05118OpenAlexW3015875678MaRDI QIDQ1987600
Ye Wang, Felix Lazebnik, Andrew G. Thomason
Publication date: 15 April 2020
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-020-0927-2
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Polynomials over finite fields (11T06) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal combinatorics (05D99)
Related Items
On some cycles in linearized Wenger graphs, Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding cycles in finite planes
- On the spectrum of Wenger graphs
- The existence of even cycles with specific lengths in Wenger's graph
- Cycle lengths in sparse graphs
- On the diameter of Wenger graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- New examples of graphs without small cycles and of large size
- Advances on the Hamiltonian problem -- a survey
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- A construction for infinite families of semisymmetric graphs revealing their full automorphism group
- Multi-color Ramsey numbers of even cycles
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Expander graphs and their applications
- Constructions of bipartite graphs from finite geometries
- An infinite series of regular edge- but not vertex-transitive graphs
- Graphs from Generalized Kac--Moody Algebras
- Recent Developments in Low-Density Parity-Check Codes
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- The History of Degenerate (Bipartite) Extremal Graph Problems
