A Result on Polynomials Derived Via Graph Theory

DOI10.1080/0025570X.2019.1614820zbMath1434.05062arXiv1904.09657OpenAlexW2974432022MaRDI QIDQ5108595

Stefaan De Winter, Robert S. Coulter, Felix Lazebnik, Alex M. Kodess

Publication date: 4 May 2020

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.09657

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Classification by girth of three-dimensional algebraically defined monomial graphs over the real numbers ⋮ On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions

Cites Work

• Spectra of graphs
• Kneser's conjecture, chromatic number, and homotopy
• Connectivity of some algebraically defined digraphs
• On Borsuk's conjecture for two-distance sets
• A brief history of the classification of the finite simple groups
• General properties of some families of graphs defined by systems of equations
• A counterexample to Borsuk’s conjecture
• Applications of Graph Theory in Linear Algebra
• Algebraic Graph Theory
• The Classification of Finite Simple Groups: A Progress Report
• Isomorphism criterion for monomial graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Digraphs
• On Some Applications of Graph Theory III
• An Application of Graph Theory to Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Result on Polynomials Derived Via Graph Theory