Fetching the paper…
Reading the bibliography…
We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory.
Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten
M. Fekete · 1923
Earlier work this paper cites.
On generalized graphs
B. Bollobás · 1965
Earlier work this paper cites.
On the addressing problem for loop switching
R. L. Graham and H. O. Pollak · 1971
Earlier work this paper cites.
Some properties of nonnegative matrices and their permanents
L. M. Brègman · 1973
Earlier work this paper cites.
The solution of the four-color-map problem
K. Appel and W. Haken · 1977
Earlier work this paper cites.
Distance matrix polynomials of trees
R. L. Graham and L. Lovász · 1978
Earlier work this paper cites.
The complexity of computing the permanent
L. G. Valiant · 1979
Earlier work this paper cites.
Spectra of graphs: Theory and application
D. M. Cvetković, M. Doob, and H. Sachs · 1980
Earlier work this paper cites.
An extremal problem for two families of sets
P. Frankl · 1982
Earlier work this paper cites.
Inequalities for two set systems with prescribed intersections
Z. Tuza · 1987
Earlier work this paper cites.
On a conjecture of Graham and Lovász about distance matrices
K. L. Collins · 1989
Earlier work this paper cites.
The distance spectrum of a tree
R. Merris · 1990
Earlier work this paper cites.
Davenport-Schinzel theory of matrices
Z. Füredi and P. Hajnal · 1992
Earlier work this paper cites.
Covering the cube by affine hyperplanes
N. Alon and Z. Füredi · 1993
Earlier work this paper cites.
Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system
G. Caporossi and P. Hansen · 2000
Earlier work this paper cites.
The Füredi-Hajnal conjecture implies the Stanley-Wilf conjecture
M. Klazar · 2000
Earlier work this paper cites.
Excluded permutation matrices and the Stanley-Wilf conjecture
A. Marcus and G. Tardos · 2004
Earlier work this paper cites.
A proof of the Kepler conjecture
T. C. Hales · 2005
Cited alongside, same era.
Increasing and decreasing subsequences and their variants
R. P. Stanley · 2007
Cited alongside, same era.
A survey of automated conjectures in spectral graph theory
M. Aouchiche and P. Hansen · 2010
Cited alongside, same era.
Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
D. Stevanović · 2010
Cited alongside, same era.
Proximity and remoteness in graphs: results and conjectures
M. Aouchiche and P. Hansen · 2011
Cited alongside, same era.
Patterns in permutations and words
S. Kitaev · 2011
Cited alongside, same era.
Combinatorics of permutations
Graphs that are cospectral for the distance laplacian
B. Brimkov, K. Duna, L. Hogben, K. Lorenzen, C. Reinhart, S.-Y. Song, and M. Yarrow · 2018
Later among the works it cites.
Molgan: An implicit generative model for small molecular graphs
N. De Cao and T. Kipf · 2018
Later among the works it cites.
Graph neural networks: A review of methods and applications
J. Zhou, G. Cui, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun · 2018
Later among the works it cites.
Solving combinatorial problems with machine learning methods
T. Guo, C. Han, S. Tang, and M. Ding · 2019
Later among the works it cites.
Exact hyperplane covers for subsets of the hypercube
J. Aaronson, C. Groenland, A. Grzesik, B. Kielak, and T. Johnston · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Bóna · 2012
Cited alongside, same era.
On families of weakly cross-intersecting set-pairs
Z. Király, Z. L. Nagy, D. Pálvölgyi, and M. Visontai · 2012
Cited alongside, same era.
Stanley-Wilf limits are typically exponential
J. Fox · 2013
Cited alongside, same era.
Some open problems on permutation patterns
E. Steingrímsson · 2013
Cited alongside, same era.
Human-level control through deep reinforcement learning
V. Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, G. Ostrovski, et al · 2015
Cited alongside, same era.
Proximity, remoteness and distance eigenvalues of a graph
M. Aouchiche and P. Hansen · 2016
Cited alongside, same era.
Later among the works it cites.
Machine learning for combinatorial optimization: a methodological tour d’horizon
Y. Bengio, A. Lodi, and A. Prouvost · 2020
Later among the works it cites.
Pattern-avoiding (0, 1)-matrices
R. A. Brualdi and L. Cao · 2020
Later among the works it cites.
Graph representation learning
W. L. Hamilton · 2020
Later among the works it cites.
Deep Reinforcement Learning Hands-On: Apply Modern RL Methods to Practical Problems of Chatbots, Robotics, Discrete Optimization, Web Automation, and More, 2nd Edition
M. Lapan · 2020
Later among the works it cites.
Reinforcement learning for combinatorial optimization: A survey
N. Mazyavkina, S. Sviridov, S. Ivanov, and E. Burnaev · 2020
Later among the works it cites.
Polynomials that vanish to high order on most of the hypercube
L. Sauermann and Y. Wigderson · 2020
Later among the works it cites.
Learning combinatorial optimization on graphs: A survey with applications to networking
N. Vesselinova, R. Steinert, D. F. Perez-Ramirez, and M. Boman · 2020
Later among the works it cites.
Refuting conjectures in extremal combinatorics via linear programming
A. Z. Wagner · 2020
Later among the works it cites.
Subspace coverings with multiplicities
A. Bishnoi, S. Boyadzhiyska, S. Das, and T. Mészáros · 2021
Closest in time.
Combinatorial optimization and reasoning with graph neural networks
Q. Cappart, D. Chételat, E. Khalil, A. Lodi, C. Morris, and P. Veličković · 2021
Closest in time.
Gurobi optimizer reference manual, 2021
L. Gurobi Optimization · 2021
Closest in time.
Spectra of variants of distance matrices of graphs and digraphs: a survey
L. Hogben and C. Reinhart · 2021
Closest in time.