Proof of a conjecture on monomial graphs
From MaRDI portal
Publication:346278
DOI10.1016/j.ffa.2016.09.001zbMath1351.05120arXiv1507.05306OpenAlexW2963665765WikidataQ123003620 ScholiaQ123003620MaRDI QIDQ346278
Felix Lazebnik, Stephen D. Lappano, Xiang-Dong Hou
Publication date: 5 December 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05306
Extremal problems in graph theory (05C35) Generalized quadrangles and generalized polygons in finite geometry (51E12) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items (9)
On the uniqueness of some girth eight algebraically defined graphs ⋮ Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers ⋮ On the uniqueness of some girth eight algebraically defined graphs. II ⋮ On the characterization of some algebraically defined bipartite graphs of girth eight ⋮ Bipartite algebraic graphs without quadrilaterals ⋮ On the DLW conjectures ⋮ On the girth of two-dimensional real algebraically defined graphs ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras ⋮ On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
Cites Work
- Unnamed Item
- Unnamed Item
- Monomial graphs and generalized quadrangles
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- New examples of graphs without small cycles and of large size
- On hypergraphs of girth five
- Cycles of even length in graphs
- On monomial graphs of girth eight
- Permutation polynomials over finite fields -- a survey of recent advances
- General properties of some families of graphs defined by systems of equations
- A new series of dense graphs of high girth
- The History of Degenerate (Bipartite) Extremal Graph Problems
This page was built for publication: Proof of a conjecture on monomial graphs
