On Linial's Conjecture for Spine Digraphs
Combinatorics
2016-06-23 v1
Abstract
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable set. We also show that Linial's Conjecture holds for spine digraphs.
Cite
@article{arxiv.1606.06765,
title = {On Linial's Conjecture for Spine Digraphs},
author = {Maycon Sambinelli and Cândida Nunes da Silva and Orlando Lee},
journal= {arXiv preprint arXiv:1606.06765},
year = {2016}
}