On regular hypergraphs of high girth

zbMATH Open1300.05198arXiv1302.5090MaRDI QIDQ405152FDOQ405152

Nathan Linial, David Ellis

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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 $S_n$ which has girth $Omega(n^{1/3})$ with high probability, in contrast to random regular $r$-uniform hypergraphs, which have constant girth with positive probability.

Full work available at URL: https://arxiv.org/abs/1302.5090

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On the girth of random Cayley graphs
• Counting hypergraphs with large girth
• Hypercycles in a random hypergraph
• On hypergraphs of girth five
• A randomized construction of high girth regular graphs

zbMATH Keywords

girthhypergraph theory

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65)

Cites Work

• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lifts, discrepancy and nearly optimal spectral gap
• Ramanujan graphs
• Title not available (Why is that?)
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• New upper bounds on the order of cages
• A new series of dense graphs of high girth
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• On hypergraphs of girth five
• On the girth of random Cayley graphs
• Title not available (Why is that?)
• Graphs with even girth and small excess
• The non-existence of certain regular graphs of girth 5
• Regular graphs with excess one
• The size of bipartite graphs with a given girth
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Moore bound for simplicial complexes
• Higher dimensional Moore bounds
• Pentagons vs. triangles

Cited In (14)

• Counting hypergraphs with large girth
• Large girth approximate Steiner triple systems
• A randomized construction of high girth regular graphs
• Title not available (Why is that?)
• Extremal regular graphs and hypergraphs related to fractional repetition codes
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Small graphs and hypergraphs of given degree and girth
• Generalized Turán problems for even cycles
• Small cores in 3-uniform hypergraphs
• Title not available (Why is that?)
• Identifying defective sets using queries of small size
• Hypercycles in a random hypergraph
• Title not available (Why is that?)
• Smart elements in combinatorial group testing problems with more defectives

This page was built for publication: On regular hypergraphs of high girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405152)