Properties of algebraically defined edge-colored graphs

Read full text Summarise with VIRAT
Authors: Aaron Christopherson, Zephyr Gilmore, Susanne Goldstein, Christina Hoff, Brian G. Kronenthal, Karen B. McCready
Cited by: 0
References: 20

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In this paper, we introduce and investigate d -dimensional algebraically defined edge-colored (ADC) graphs, which are constructed as follows. Given a field F , and polynomials f 2 , … , f d : F 2 → F , we start with a complete bipartite graph K where both partite sets P and L are copies of F d . We color an edge between two vertices ( a , a 2 , … , a d ) ∈ P and [ x , x 2 , … , x d ] ∈ L solid blue if a i + x i = f i ( a , x ) for all 2 ≤ i ≤ d , otherwise the corresponding edge is colored dotted red. We study the existence and length of properly colored cycles and properly connected circuits, and classify ADC graphs by proper diameter. The induced subgraph generated by the set of all blue edges is an algebraically defined graph; algebraically defined graphs are of interest in the literature due to both their graph theoretic properties and their connections to incidence geometry.

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Graph Theory Research Advanced Combinatorial Mathematics

Publication details

Journal / source
Discrete Mathematics
Volume
349
Issue
9
Pages
115122–115122
Publication date
25 March 2026
Language
EN