On graphs with well-distributed edge density (2402.06803v2)
Abstract: In this paper, we introduce a class of graphs which we call average hereditary graphs. Most 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. 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. This class of graphs is explored further by proving some interesting properties regarding the class of average hereditary graphs. An equivalent condition is provided 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. We then provide a construction for average hereditary graphs, using which an average hereditary graph can be recursively constructed. We also show that this class of graphs is closed under a binary operation, from this another construction is obtained for average hereditary graphs, and we see some interesting algebraic properties this class of graphs has. We then explore the effect on the complexity of graph 3-coloring problem when the input is restricted to average hereditary graphs.
- Np-hard graph problems and boundary classes of graphs. Theoretical Computer Science, 389(1-2):219–236, 2007.
- Vladimir E. Alekseev. On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Applied Mathematics, 132(1-3):17–26, 2003.
- Rowland Leonard Brooks. On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society, 37:194–197, 1941.
- Introduction to Algorithms, fourth edition. MIT Press, 2022.
- Reinhard Diestel. Reinhard Diestel Graph Theory Electronic Edition 2017. Springer-Verlag Heidelberg, 1997.
- Yefim Dinitz. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl., 11:1277–1280, 01 1970.
- Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19(2):248–264, apr 1972.
- Maximal flow through a network. Canadian Journal of Mathematics, 8:399–404, 1956.
- A. V. Goldberg. Finding a maximum density subgraph. Technical report, USA, 1984.
- A new approach to the maximum-flow problem. J. ACM, 35(4):921–940, oct 1988.
- Richard Manning Karp. Reducibility among combinatorial problems. Proceedings of a symposium on the Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York., 1972.
- B. R. Myers and R. Liu. A lower bound on the chromatic number of a graph. Networks, 1(3):273–277, 1971.
- Three new upper bounds on the chromatic number. Discrete Applied Mathematics, 159(18):2281–2289, 2011.
- Douglas Brent West. Introduction to Graph Theory. Prentice Hall, 2001.