𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orthogonal representations over finite fields and the chromatic number of graphs

✍ Scribed by René Peeters

Book ID
105138380
Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
710 KB
Volume
16
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic number of finite and infinite
Chromatic number of finite and infinite graphs and hypergraphs
✍ Paul Erdös; Andras Hajnal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 349 KB

We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemer6di, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems. Nous avons 6crit beaucoup d'articles, certains en collabo

The chromatic numbers of graph bundles o
The chromatic numbers of graph bundles over cycles
✍ Sandi Klavẑar; Bojan Mohar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 565 KB

Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers of product bundles with respect to the Cartesian, strong and tensor product whose base and fiber are cycles are determined. ## 1. Introduction If G is a graph, V(G) and E(G) denote its vertex and e

Finite fields and the 1-chromatic number
Finite fields and the 1-chromatic number of orientable surfaces
✍ Vladimir P. Korzhik 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract The 1‐chromatic number χ~1~(__S__~__p__~) of the orientable surface __S__~__p__~ of genus __p__ is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of ord

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with