Unavoidable arrays ¨ Klas Markstr¨ om and Lars-Daniel Ohman Abstract. We investigate edge list-colourings of complete bipartite graphs, where the lists are shorter than the length guaranteed by Galvin’s theorem to al
Add to Reading List

Document Date: 2013-12-11 09:07:22

File Size: 282,10 KB

Facility

Person

SocialTag

• Nonassociative algebra
• Array
• Matrix
• Computing
• Software engineering
• Computer programming
• Sorting algorithms
• Design of experiments
• Error detection and correction
• Latin square