| dc.contributor.author | ELLIS, DC | en_US |
| dc.contributor.author | Linial, N | en_US |
| dc.date.accessioned | 2016-09-09T12:03:22Z | |
| dc.date.available | 2014-02-23 | en_US |
| dc.date.issued | 2014-03-10 | en_US |
| dc.date.submitted | 2016-08-29T15:40:03.069Z | |
| dc.identifier.issn | 1097-1440 | en_US |
| dc.identifier.other | P1.54 | |
| dc.identifier.other | P1.54 | |
| dc.identifier.other | P1.54 | en_US |
| dc.identifier.other | P1.54 | en_US |
| dc.identifier.other | P1.54 | en_US |
| dc.identifier.other | P1.54 | en_US |
| dc.identifier.uri | file:///C:/Users/ylw164/Downloads/3851-9721-1-PB.pdf | |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/15109 | |
| dc.identifier.uri | https://arxiv.org/pdf/1302.5090v4.pdf | |
| dc.description.abstract | We give lower bounds on the maximum possible girth of an r-uniform, d-regular hypergraph with at most n vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute constant factor (viz., by a factor of between 3/2 + o(1) and 2 + o(1)). We also define a random r-uniform ‘Cayley’ hypergraph on the symmetric group Sn which has girth Ω(sqroot(log |S_n|)) with high probability, in contrast to random regular r-uniform hypergraphs, which have constant girth with positive probability. | en_US |
| dc.description.sponsorship | Research supported in part by a Feinberg Visiting Fellowship from the Weizmann Institute of Science. | en_US |
| dc.language | English | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Electronic Journal of Combinatorics | en_US |
| dc.title | On Regular Hypergraphs of High Girth | en_US |
| dc.type | Article | |
| dc.rights.holder | 2014. The authors | |
| pubs.issue | 1 | en_US |
| pubs.notes | No embargo | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 21 | en_US |
| dcterms.dateAccepted | 2014-02-23 | en_US |
