BibTeX
CSL-JSON
MLA
Harvard
Every Orientation of a $4$-Chromatic Graph has a Non-Bipartite Acyclic Subgraph
release_5ztkwahiancwzodxsbno3vuwhe
by
Asaf Shapira
Published
in Electronic Journal of Combinatorics by The Electronic Journal of Combinatorics.
2022 Volume 29
Abstract
Let $f(n)$ denote the smallest integer such that every directed graph with chromatic number larger than $f(n)$ contains an acyclic subgraph with chromatic number larger than $n$. The problem of bounding this function was introduced by Addario-Berry et al., who noted that $f(n) \leqslant n^2$. The only improvement over this bound was obtained by Nassar and Yuster, who proved that $f(2)=3$ using a deep theorem of Thomassen. Yuster asked if this result can be proved using elementary methods. In this short note we provide such a proof.
In application/xml+jats
format
Archived Files and Locations
application/pdf 201.2 kB
file_otghyczaejaqfik33f5i3lzr5u
|
www.combinatorics.org (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Date 2022-01-28
article-journal
Stage
published
Date 2022-01-28
DOI
10.37236/10727
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar