:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, van Hoesel, Stan, Michaux, Valentin
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2605.00524
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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 distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

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

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)

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

Eigenvalue bounds for distance-edge colorings
by: Abiad, Aida, et al.
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)

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

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

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

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

An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
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)

On the chromatic number of powers of subdivisions of graphs
by: Anastos, Michael, et al.
Published: (2024)

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

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

Bounds for the independence and chromatic numbers of locally sparse graphs
by: Dhawan, Abhishek
Published: (2024)

On the chromatic numbers of Johnson type graphs
by: Cherkashin, Danila
Published: (2025)

The oriented chromatic number of random graphs of bounded degree
by: Gunderson, Karen, et al.
Published: (2022)

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

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

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

Quantum independence and chromatic numbers
by: Godsil, Chris, et al.
Published: (2024)

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

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

Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)

Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)

Ratio bound (Lovász number) versus inertia bound
by: Ihringer, Ferdinand
Published: (2023)

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

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

New lower bounds on the non-repetitive chromatic number of some graphs
by: Tao, Tianyi, et al.
Published: (2025)

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

Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
by: Steinke, Finn A., et al.
Published: (2026)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

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

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

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Common graphs with arbitrary chromatic number
by: Kral, Daniel, et al.
Published: (2022)