Matt Noble

collaborators

3 papers

math.CO2021

Embedding Euclidean Distance Graphs in $R^{n}$ and $Q^{n}$

Matt Noble

For $S \subseteq R$ , positive integer $n$ , and $d > 0$ , let $G (S^{n}, d)$ be the graph whose vertex set is $S^{n}$ where any two vertices are adjacent if and only if they are…

math.CO2021

On Rainbow Cycles and Proper Edge Colorings of Generalized Polygons

Matt Noble

An edge coloring of a simple graph $G$ is said to be \textit{proper rainbow-cycle-forbidding} (PRCF, for short) if no two incident edges receive the same color and for any cycle in…

math.CO2021

Answer to an Isomorphism Problem in $Z^{2}$

Matt Noble

For $S \subset R^{n}$ and $d > 0$ , denote by $G (S, d)$ the graph with vertex set $S$ with any two vertices being adjacent if and only if they are at a Euclidean distance $d$ …

Embedding Euclidean Distance Graphs in Rn and Qn

On Rainbow Cycles and Proper Edge Colorings of Generalized Polygons

Answer to an Isomorphism Problem in Z2

Embedding Euclidean Distance Graphs in $R^{n}$ and $Q^{n}$

Answer to an Isomorphism Problem in $Z^{2}$