On regular hypergraphs of high girth
From MaRDI portal
Publication:405152
zbMath1300.05198arXiv1302.5090MaRDI QIDQ405152
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.5090
File on IPFS
Related Items (9)
Small cores in 3-uniform hypergraphs ⋮ Identifying defective sets using queries of small size ⋮ Generalized Turán problems for even cycles ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Small graphs and hypergraphs of given degree and girth ⋮ Unnamed Item ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ Extremal regular graphs and hypergraphs related to fractional repetition codes ⋮ Large girth approximate Steiner triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higher dimensional Moore bounds
- Lifts, discrepancy and nearly optimal spectral gap
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Pentagons vs. triangles
- Ramanujan graphs
- The non-existence of certain regular graphs of girth 5
- Regular graphs with excess one
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- New upper bounds on the order of cages
- The size of bipartite graphs with a given girth
- On hypergraphs of girth five
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- On the girth of random Cayley graphs
- Graphs with even girth and small excess
- A new series of dense graphs of high girth
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- A Moore bound for simplicial complexes
This page was built for publication: On regular hypergraphs of high girth
