✦ LIBER ✦

A note on local colorings of graphs

✍ Scribed by Andrzej Ruciński; Miroslaw Truszczyński

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 223 KB
Volume: 164
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00058-1

No coin nor oath required. For personal study only.

✦ Synopsis

Recently, R6dl and Rucifiski [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 -p. We write F ~ (G)r if for every r-coloring of the edges of F there is a monochromatic copy of G.

📜 SIMILAR VOLUMES

Generalized local colorings of graphs

✍ Miroslaw Truszczyński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Local optimization of colorings of graph

Local optimization of colorings of graphs

✍ A. V. Anisimov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 855 KB

A note on defective colorings of graphs

A note on defective colorings of graphs in surfaces

✍ Dan Archdeacon 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using

A note on list-colorings

✍ Amanda Chetwynd; Roland Häggkvist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

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 group colorings

✍ Daniel Král'; Ondřej Pangrác; Heinz-Jürgen Voss 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## Abstract We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree δ is greater than δ/(2, ln δ) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar