betaFeedback

WorksMathematics

Antidirected paths on five vertices in 5-chromatic digraphs

Abstract

We prove that every 5-chromatic digraph containing no copy of the regular tournament on five vertices contains both antidirected paths on five vertices. This answers a question posed by El Sahili in 2004. The proof uses an edge bound for 5-critical graphs to constrain the out-degrees in a counterexample and obtain a contradiction by constructing a proper 4-colouring.

Paper details

vlnc:W_59p6zh9w
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…