Fetching the paper…
Reading the bibliography…
The famous $n$-queens problem asks how many ways there are to place $n$ queens on an $n \times n$ chessboard so that no two queens can attack one another.
G. Pólya, Über die ”doppelt-periodischen” Losüngen des n-Damen-Problems
1918
Earlier work this paper cites.
P. Hall, On Representatives of Subsets
1935
Earlier work this paper cites.
W. Tutte, The factorization of linear graphs
1947
Earlier work this paper cites.
G. Dirac, Some theorems on abstract graphs
1952
Earlier work this paper cites.
H. Kuhn, The Hungarian Method for the assignment problem
1955
Earlier work this paper cites.
D. Gale, L. Shapley, College admissions and the stability of marriage
1962
Earlier work this paper cites.
P. Erdős, H. Hanani, On a limit theorem in combinatorial analysis
1963
Earlier work this paper cites.
E. Dijkstra, EWD 316: A Short Introduction To the Art of Programming
1971
Earlier work this paper cites.
R. Karp, Reducibility Among Combinatorial Problems
1972
Earlier work this paper cites.
P. Campbell, Gauss and the eight queens problem: A study in miniature of the propagation of historical error
1977
Earlier work this paper cites.
H. Shapiro, Theoretical limitations on the efficient use of parallel memories
1978
Earlier work this paper cites.
L. Valiant, The complexity of computing the permanent
1979
Earlier work this paper cites.
L. Valiant, The complexity of enumeration and reliability problems
1979
Earlier work this paper cites.
P. Frankl, V. Rödl, Near perfect coverings in graphs and hypergraphs
1985
Earlier work this paper cites.
V. Rödl, On a packing and covering problem
1985
Earlier work this paper cites.
P. Monsky, E3162
1989
Cited alongside, same era.
N. Pippenger, J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs
1989
Cited alongside, same era.
C. Erbas, S. Sarkeshik, M. Tanik, Different perspectives of the n n -queens problem
1992
Cited alongside, same era.
I. Rivin, I. Vardi, P. Zimmerman The n n -queens problem
1994
Cited alongside, same era.
J. Kahn, A linear programming perspective on the Frankl-Rödl-Pippenger Theorem
1996
Cited alongside, same era.
N. Alon, J. Kim, J. Spencer, Nearly perfect matchings in regular simple hypergraphs
1997
Cited alongside, same era.
J. Bell, B. Stevens, A survey of known results and research areas for n n -queens
2009
Later among the works it cites.
T. Bohman, The triangle-free process
2009
Later among the works it cites.
T. Bohman, A. Frieze, E. Lubetzky, A note on the random greedy triangle packing algorithm
2010
Later among the works it cites.
V. Rödl, A. Ruciński, Dirac-type questions for hypergraphs a survey (or more problems for Endre to solve)
2010
Later among the works it cites.
N. Linial, Z. Luria, An upper bound on the number of high-dimensional permutations
2014
Later among the works it cites.
T. Bohman, A. Frieze, E. Lubetzky, Random triangle removal
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1998
Cited alongside, same era.
D. Grable, More-than-nearly-perfect packings and partial designs
1999
Cited alongside, same era.
N. Wormald, The differential equation method for random graph processes and greedy algorithms
1999
Cited alongside, same era.
S. Janson, T. Łuczak, A. Ruciński, Random Graphs
2000
Cited alongside, same era.
S. Yang, C. Wang, C. Liu, T. Chiang, in: H.–Y. Shum (Ed.), Fast motion estimation using N-queen pixel decimation
2001
Cited alongside, same era.
M. Molloy, B. Reed, Graph Colouring and the Probabilistic Method
2002
Cited alongside, same era.
B. Barber, D. Kühn, D. Osthus, Edge-decompositions of graphs with high minimum degree
2016
Later among the works it cites.
S. Boucheron, G. Lugosi and P. Massart, Concentration inequalities: a nonasymptotic theory of independence
2016
Later among the works it cites.
Y. Zhao, Recent advances on Dirac-type problems for hypergraphs
2016
Later among the works it cites.
P. Keevash, Counting designs
2018
Later among the works it cites.
P. Bennett, T. Bohman, A natural barrier in random greedy hypergraph matching
2019
Later among the works it cites.
S. Eberhard, F. Manners, R. Mrazović, Additive triples of bijections, or the toroidal semiqueens problem
2019
Later among the works it cites.
S. Glock, D. Kühn, A. Lo, R. Montgomery, D. Osthus, On the decomposition threshold of a given graph
2019
Later among the works it cites.
S. Ehard, S. Glock, F. Joos, Pseudorandom hypergraph matchings
2020
Later among the works it cites.