Fetching the paper…
Reading the bibliography…
Given a $k$-uniform hypergraph $H$ on $n$ vertices, an even cover in $H$ is a collection of hyperedges that touch each vertex an even number of times.
A new series of dense graphs of high girth
F. Lazebnik, V. Ustimenko and A. Woldar · 1995
Earlier work this paper cites.
The Moore Bound for Irregular Graphs
N. Alon, S. Hoory and N. Linial · 2002
Earlier work this paper cites.
Exponential lower bound for 2-query locally decodable codes via a quantum argument
I. Kerenidis and R. Wolf · 2004
Earlier work this paper cites.
Witnesses for non-satisfiability of dense random 3CNF formulas
U. Feige, J. H. Kim and E. Ofek · 2006
Earlier work this paper cites.
Lower bounds for linear locally decodable codes and private information retrieval
O. Goldreich, H. Karloff, L. Schulman and L. Trevisan · 2006
Earlier work this paper cites.
Rainbow Turán problems
P. Keevash, D. Mubayi, J. Verstrae̋te and B. Sudakov · 2007
Earlier work this paper cites.
Small linear dependencies for binary vectors of low weight
U. Feige · 2008
Earlier work this paper cites.
Parity check matrices and product representations of squares
A. Naor and J. Verstraëte · 2008
Earlier work this paper cites.
Towards 3-query locally decodable codes of subexponential length
S. Yekhanin · 2008
Cited alongside, same era.
On the power of two, three and four probes
N. Alon, U. Feige · 2009
Cited alongside, same era.
3-query locally decodable codes of subexponential length
K. Efremenko · 2009
Cited alongside, same era.
On a theorem of Shkredov
T. Sanders · 2010
Cited alongside, same era.
Locally Decodable Codes and Private Information Retrieval Schemes
S. Yekhanin · 2010
Cited alongside, same era.
Incidence Theorems and Their Applications
Z. Dvir · 2012
Cited alongside, same era.
A proof of Ringel’s conjecture
R. Montgomery, A. Pokrovskiy and B. Sudakov · 2021
Later among the works it cites.
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random
V. Guruswami, P. Kothari and P. Manohar · 2022
Later among the works it cites.
Essentially tight bounds for rainbow cycles in proper edge-colourings
N. Alon, M. Bucić, L. Sauermann, D. Zakharov and O. Zamir · 2023
Later among the works it cites.
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
O. Alrabiah, V. Guruswami, P. Kothari and P. Manohar · 2023
Later among the works it cites.
A simple and sharper proof of the hypergraph Moore bound
T. Hsieh, P. Kothari and S. Mohanty · 2023
Later among the works it cites.
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Yekhanin · 2012
Cited alongside, same era.
Locally Decodable Codes
Z. Dvir · 2016
Cited alongside, same era.
Generalized girth problems in graphs and hypergraphs
U. Feige and T. Wagner
Cited in the paper.
P. Kothari and P. Manohar · 2023
Later among the works it cites.
A proof of the Ryser-Brualdi-Stein conjecture for large even
R. Montgomery · 2023
Later among the works it cites.