Jump to ContentJump to Main Navigation
Combinatorics, Complexity, and ChanceA Tribute to Dominic Welsh$
Users without a subscription are not able to see the full content.
Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Geoffrey Grimmett and Colin McDiarmid

Print publication date: 2007

Print ISBN-13: 9780198571278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198571278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 09 August 2020

ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE

ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE

Chapter:
(p.272) 17 ADVANCES ON THE ERDŐS–FABER–LOVÁSZ CONJECTURE
Source:
Combinatorics, Complexity, and Chance
Author(s):

David Romero

Abdón S´nchez-Arroyo

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198571278.003.0017

A hypergraph is linear if no two distinct edges intersect in more than one vertex. A well-known conjecture of Erdős, Faber, and Lovász states that if a linear hypergraph has n edges, each of size n, then there is a n-vertex colouring of the hypergraph such that each edge contains one vertex of each colour. Dating back to 1972, it is very surprising that this conjecture has not been settled in its full generality. This chapter presents some advances on it.

Keywords:   hypergraph, Erdős, Faber, Lovász, conjectures

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .