Author:
Zatesko Leandro M.,Carmo Renato,Guedes André L.P.,Machado Raphael C.S.,Figueiredo Celina M.H.
Abstract
An r-graph is an r-regular graph G on an even number of vertices where every odd set X ⊆ V (G) is connected by at least r edges to its complement V (G) \ X. Every r-graph has a perfect matching and in a poorly matchable r-graph every pair of perfect matchings intersect, which implies that poorly matchable r-graphs are not r-edge-colourable. We prove, for each fixed r ≥ 3, that poorly matchable r-graph recognition is coNP-complete, an indication that, for each odd d ≥ 3, it may be a hard problem to recognise d-regular (d − 1)-edge-connected non-d-edge-colourable graphs, referred to as d-snarks in this paper. We show how to construct, for every fixed odd d ≥ 5, an infinite family of d-snarks. These families provide a natural extension to the well-known Loupekine snarks. We also discuss how the hunting of the smallest d-snarks may help in strengthening and better understanding the major Overfull Conjecture on edge-colouring simple graphs.
Funder
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Reference63 articles.
1. Counting r-graphs without forbidden configurations
2. Set Partitioning via Inclusion-Exclusion
3. Brinkmann G., Goedgebeur J., H¨agglund J. and Markström K., Generation and Properties of Snarks. Vol. 103 (2012).
4. Brown W.G., Erdős P. and Sós V.T., Some extremal problems on r-graphs. In New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971). Academic Press, New York (1973) 53–63.