On coloring graphs with well-distributed edge density

Syed Mujtaba Hassan; Shahid Hussain

Home/Archive/arXiv

arXiv · 2402.06803

On coloring graphs with well-distributed edge density

Syed Mujtaba Hassan·Shahid Hussain

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as regular graphs, trees and other popular classes of graphs. The paper aims to explore some interesting properties regarding colorings average hereditary graphs. We prove a new upper bound for the chromatic number of a graph in terms of its maximum average degree and show that this bound is an improvement on previous bounds. From this, we show a relationship between the average degree and the chromatic number of an average hereditary graph. We then show that even with new bound, the graph 3-coloring problem remains NP-hard when the input is restricted to average hereditary graphs. We provide an equivalent condition for a graph to be average hereditary, through which we show that we can decide if a given graph is average hereditary in polynomial time.

Explore related subjects

cs.DM cs.CC math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Syed Mujtaba Hassan, Shahid Hussain. 2025-08-08. On coloring graphs with well-distributed edge density. https://arxiv.org/abs/2402.06803

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Quaternary Legendre Pair of Length 64

We construct an explicit quaternary Legendre pair of length $64$. To the best of our knowledge, this is the first reported construction at this length.

cs.DM↗

arXiv2026

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM↗

arXiv2026

Three Hardness Results for Graph Similarity Problems

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance $δ_{\mathcal{E}}$, and the metrics arising from $\ell_p$-operator norms, which we denote by $δ_p$ and $δ_{|p|}$. We address the following question: can these measures of similarity be used to design polynomial-time approximation algorithms for graph isomorphism? We show that computing an optimal value of $δ_{\mathcal{E}}$ is \NP-hard on pairs of graphs with the same number of edges. In addition, we show that computing optimal values of $δ_p$ and $δ_{|p|}$ is \NP-hard even on pairs of $1$-planar graphs with the same degree sequence and bounded degree. These two results improve on previous known ones, which did not examine the restricted case where the pairs of graphs are required to have the same number of edges. Finally, we study similarity problems on strongly regular graphs and prove some near optimal inequalities with interesting consequences on the computational complexity of graph and group isomorphism.

cs.DM↗