On the multiplication of divisions: The use of graphs for sports scheduling
β Scribed by D. de Werra
- Publisher
- John Wiley and Sons
- Year
- 1985
- Tongue
- English
- Weight
- 601 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let x(G) and o(G) denote the chromatic number and clique number of a graph G. We prove that x can be bounded by a function of o for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line
If F, G, and H are graphs, write F ~ (G,/-/) to mean that however the edges of F are colored red and blue, either the red (partial) subgraph contains a copy of G or the blue subgraph contains a copy of H. Many interesting questions exist concerning this relation, particularly involving the case in w
A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t