𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph products and monochromatic multiplicities

✍ Scribed by Andrew Thomason

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
558 KB
Volume
17
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Planar graph colorings without short mon
Planar graph colorings without short monochromatic cycles
✍ TomΓ‘Ε‘ Kaiser; Riste Ε krekovski πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On

Tight products and graph expansion
Tight products and graph expansion
✍ Amit Daniely; Nathan Linial πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract In this article, we study a new product of graphs called __tight product__. A graph __H__ is said to be a tight product of two (undirected multi) graphs __G__~1~ and __G__~2~, if __V__(__H__) = __V__(__G__~1~) Γ— __V__(__G__~2~) and both projection maps __V__(__H__)β†’__V__(__G__~1~) and _

Codes And Xor Graph Products
Codes And Xor Graph Products
✍ Noga Alon*; Eyal Lubetzky† πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 280 KB
Products of chains with monochromatic ma
Products of chains with monochromatic maximal chains and antichains
✍ D. Duffus; T. Goddard πŸ“‚ Article πŸ“… 1996 πŸ› Springer Netherlands 🌐 English βš– 996 KB

There is a product of two linear orders of size 2nn with the property that every subset or complement thereof contains a maximal chain. Furthermore, for regular l&, there is a product of two linear orders of size t&+2 that when colored with fewer than & colors always has a monochromatic maximal chai