English

On orientations with forbidden out-degrees

Combinatorics 2024-06-10 v1

Abstract

Let GG be a dd-regular graph and let F{0,1,2,,d}F\subseteq\{0, 1, 2, \ldots, d\} be a list of forbidden out-degrees. Akbari, Dalirrooyfard, Ehsani, Ozeki, and Sherkati conjectured that if F<12d|F|<\tfrac{1}{2}d, then GG should admit an FF-avoiding orientation, i.e., an orientation where no out-degrees are in the forbidden list FF. The conjecture is known for d4d\leq 4 due to work of Ma and Lu, and here we extend this to d6d\leq 6. The conjecture has also been studied in a generalized version, where d,Fd, F are changed from constant values to functions d(v),F(v)d(v), F(v) that vary over all vV(G)v\in V(G). We provide support for this generalized version by verifying it for some new cases, including when GG is 2-degenerate and when every F(v)F(v) has some specific structure.

Keywords

Cite

@article{arxiv.2406.05095,
  title  = {On orientations with forbidden out-degrees},
  author = {Owen Henderschedt and Jessica McDonald},
  journal= {arXiv preprint arXiv:2406.05095},
  year   = {2024}
}

Comments

10 pages, 2 figures

R2 v1 2026-06-28T16:57:35.300Z