6 problems

For positive integers $n$ and nonnegative integers $d$, let $G_n(d)$ be the graph whose vertices are the monomials of degree $d$ in $n$ variables, with two monomials adjacent exact…

For $q=2^e$, consider the generalized quadrangles arising from monomial graphs over $\mathbb F_q$. Glynn's conjecture. The known examples of such generalized quadrangles represent…

For $d\geq 0$, let $G_3(d)$ be the graph whose vertices are the monomials of degree $d$ in three variables, with two monomials adjacent exactly when their least common multiple has…

For positive integers $n$ and nonnegative integers $d$, let $G_n(d)$ be the graph whose vertices are the monomials of degree $d$ in $n$ variables, with two monomials adjacent exact…

Let $G_3(d)$ be the graph on the monomials of degree $d$ in three variables, with two monomials adjacent exactly when their least common multiple has degree $d+1$. Let…

For positive integers $n$ and nonnegative integers $d$, let $G_n(d)$ be the graph whose vertices are the monomials of degree $d$ in $n$ variables, with two monomials adjacent exact…