On an extremal hypergraph problem related to combinatorial batch codes

DOI10.1016/j.dam.2013.08.046zbMath1300.05138arXiv1206.1996OpenAlexW2079125810MaRDI QIDQ741768

Niranjan Balachandran, Srimanta Bhattacharya

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Turán numbersextremal hypergraphscombinatorial batch codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

Derandomized Construction of Combinatorial Batch Codes ⋮ Some optimal combinatorial batch codes with \(k=5\) ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs ⋮ Turán numbers and batch codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial batch codes: a lower bound and optimal constructions
• Combinatorial batch codes and transversal matroids
• Optimal batch codes: many items or low retrieval requirement
• Finite generalized quadrangles
• Cycles of even length in graphs
• Combinatorial batch codes
• On extremal problems of graphs and generalized graphs
• On Arithmetic Progressions of Cycle Lengths in Graphs
• A note on the Turán function of even cycles
• Batch codes and their applications
• A new series of dense graphs of high girth
• Relaxations of Hall’s Condition: Optimal batch codes with multiple queries
• On a problem of K. Zarankiewicz
• Erratum