2016
DOI: 10.1007/s11856-016-1361-2
|View full text |Cite
|
Sign up to set email alerts
|

Coloring, sparseness and girth

Abstract: An r-augmented tree is a rooted tree plus r edges added from each leaf to ancestors. For d, g, r ∈ N, we construct a bipartite r-augmented complete d-ary tree having girth at least g. The height of such trees must grow extremely rapidly in terms of the girth.Using the resulting graphs, we construct sparse non-k-choosable bipartite graphs, showing that maximum average degree at most 2(k − 1) is a sharp sufficient condition for k-choosability in bipartite graphs, even when requiring large girth. We also give a n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 17 publications
(27 citation statements)
references
References 14 publications
0
27
0
Order By: Relevance
“…To start with the smallest open case, is there an * such that every (3, * )-choosable graph is 4-choosable? If so, is the value suggested by Table I optimal, i.e., is it true that every (3,9)-choosable graph is 4-choosable?…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…To start with the smallest open case, is there an * such that every (3, * )-choosable graph is 4-choosable? If so, is the value suggested by Table I optimal, i.e., is it true that every (3,9)-choosable graph is 4-choosable?…”
Section: Resultsmentioning
confidence: 99%
“…Recently, Alon et al. sharpened the boundary between =2k2 and =2k1 by exhibiting high girth, bipartite, non‐(k,2k1)‐choosable graphs all proper subgraphs of which have average degree at most 2k2.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For completeness, we sketch it in Section 5. Another related family of graphs of high chromatic number that falls under the conditions of Theorem 1.10. is described in [1,Theorem 3.4]. From these constructions, we deduce the following result:  , there exists a graph G d g , with chromatic number at least d, girth at least g, and…”
Section: Dpmentioning
confidence: 84%
“…Another related family of graphs of high chromatic number that falls under the conditions of Theorem . is described in , Theorem 3.4]. From these constructions, we deduce the following result:…”
Section: Introductionmentioning
confidence: 82%