Cover Image

Eigenvalue bounds for distance-edge colorings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Reijnders, Harper
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory
by: Abiad, Aida, et al.
Published: (2025)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)

Eigenvalue bounds for the quantum chromatic number of graph powers
by: Abiad, Aida, et al.
Published: (2025)

Eigenvalue bounds and alternating rank-metric codes
by: Abiad, Aida, et al.
Published: (2024)

The edge-isoperimetric number of graphs and their powers: approaches from spectral graph theory, optimization and finite geometry
by: Abiad, Aida, et al.
Published: (2026)

A graph energy conjecture through the lenses of semidefinite programming
by: Abiad, Aida, et al.
Published: (2025)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

Tales of Hoffman: from a distance
by: Abiad, Aida, et al.
Published: (2025)

Unified bounds for the independence number of graph powers
by: Abiad, Aida, et al.
Published: (2024)

Hoffman colorings of graphs
by: Abiad, Aida, et al.
Published: (2024)

Hoffman colorability of (strongly) regular graphs
by: Abiad, Aida, et al.
Published: (2025)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)

On the $Z_q$-forcing number: computational approach and exact values
by: Abiad, Aida, et al.
Published: (2025)

An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
by: Abiad, Aida, et al.
Published: (2026)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
by: Abiad, Aida, et al.
Published: (2026)

A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
by: Abiad, Aida, et al.
Published: (2024)

Switching graphs and Hadamard matrices
by: Abiad, Aida, et al.
Published: (2024)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, et al.
Published: (2026)

A linear programming bound for sum-rank metric codes
by: Abiad, Aida, et al.
Published: (2024)

Constructing cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2022)

Extending edge-colorings of distance-2 matchings in the hypercube
by: Bärnkopf, Pál
Published: (2025)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
by: Abiad, Aida, et al.
Published: (2023)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
by: Abiad, Aida, et al.
Published: (2026)

On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
by: Abiad, Aida, et al.
Published: (2025)

The Shannon capacity of graph powers
by: Abiad, Aida, et al.
Published: (2025)

On the existence of small strictly Neumaier graphs
by: Abiad, Aida, et al.
Published: (2023)

Note on the product of the largest and the smallest eigenvalue of a graph
by: Abiad, Aida, et al.
Published: (2024)

Extending edge colorings of distance-3 matchings in the Cartesian product of graphs
by: Bärnkopf, Pál, et al.
Published: (2023)

Infinitely many counterexamples to a conjecture of Lovász
by: Abiad, Aida, et al.
Published: (2025)

Counting cospectral graphs obtained via switching
by: Abiad, Aida, et al.
Published: (2025)

On graphs with girth at least five achieving Steffen's edge coloring bound
by: Chen, Guantao, et al.
Published: (2026)

Extending partial edge-colorings of bounded size in Cartesian products of graphs
by: Bärnkopf, Pál, et al.
Published: (2026)

Tight bounds for rainbow partial $F$-tiling in edge-colored complete hypergraphs
by: Deng, Jinghua, et al.
Published: (2024)

Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
by: Kuang, Peiru, et al.
Published: (2026)

Switching methods of level 2 for the construction of cospectral graphs
by: Abiad, Aida, et al.
Published: (2024)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

$t$-tone edge coloring of graphs
by: Bazzal, Hadeel Al
Published: (2026)

Embedding arbitrary edge-colorings of hypergraphs into regular colorings
by: Wang, Xiaomiao, et al.
Published: (2024)

e-injective coloring: injective and 2-distance colorings conjectures
by: Mirdamad, Shahrzad Sadat, et al.
Published: (2024)