A note on intersecting hypergraphs with large cover number

dc.contributor.author	Haxell, P.E.
dc.contributor.author	Scott, A.D.
dc.date.accessioned	2020-07-06T14:33:43Z
dc.date.available	2020-07-06T14:33:43Z
dc.date.issued	2017-08-11
dc.description	Published by 'The Electronic Journal of Combinatorics' at 10.37236/6460.	en
dc.description.abstract	We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r−4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.	en
dc.description.sponsorship	Natural Sciences and Engineering Research Council of Canada	en
dc.identifier.uri	https://doi.org/10.37236/6460
dc.identifier.uri	http://hdl.handle.net/10012/16026
dc.language.iso	en	en
dc.publisher	The Electronic Journal of Combinatorics	en
dc.subject	partite hypergraph	en
dc.subject	intersecting	en
dc.subject	cover	en
dc.title	A note on intersecting hypergraphs with large cover number	en
dc.type	Article	en
dcterms.bibliographicCitation	Haxell, P. E., and A. D. Scott. “A Note on Intersecting Hypergraphs with Large Cover Number.” The Electronic Journal of Combinatorics, August 11, 2017, P3.26-P3.26. https://doi.org/10.37236/6460.	en
uws.contributor.affiliation1	Faculty of Mathematics	en
uws.contributor.affiliation2	Combinatorics and Optimization	en
uws.peerReviewStatus	Reviewed	en
uws.scholarLevel	Faculty	en
uws.typeOfResource	Text	en

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1