In this article we discuss the current results on the list chromatic conjecture and prove that if G is a triangle free graph with maximum degree A then xi(G) 5 9A/5. If the term "a classic" can be used about a mathematical problem less than 10 years old, then surely the following question by Jeff D
A Note on List Arboricity
β Scribed by P.D. Seymour
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 181 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that, for any graph or matroid, its arboricity'' and its list arboricity'' are equal.
1998 Academic Press
A celebrated recent theorem of Galvin [2] asserts that for any bipartite graph, its chromatic index and its list-chromatic index are equal. This can be formulated as a property of the ``independence system'' of matchings in a bipartite graph. In private communication, Stefan Burr asked which other independence systems had this property, and in particular whether the independence system of forests in a graph had the property. We shall show that the latter is true. More precisely, we prove the following.
Proof. We may assume that P(e) [1, ..., n] for all e # E(M). For 1 i n, let Q i =[e # E(M) : i # P(e)]. Let M i be the restriction of M to Q i
π SIMILAR VOLUMES
William H. Pickering, and the remaining three-quarters by Professor Solon I. Bailey. The instrument used was the 1 3 inch Hoyden telescope. A power of 450 was ordinarily employed. The stars whose numbers in the Cordoba General Catalogue are given below were found to have companions whose distances
## Abstract We prove in this note that the linear vertexβarboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.
## Abstract Waiting times are commonly used as a rationing device in health care and the public sector. We develop a stylised model, which predicts the dynamics of waiting times and waiting lists over time as a function of differing demand and supply parameters. We show that a path with __decreasin