On the public citation graph
Proof of the van der Waerden conjecture for permanents
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01110156openalex-snapshot
On the number of non isomorphic Steiner triple systems
inferredcites →https://doi.org/10.1007/bf01215371openalex-snapshot
Nonisomorphic Steiner triple systems
inferredcites →https://doi.org/10.1016/0024-3795(71)90036-xopenalex-snapshot
Some notes on the van der Waerden conjecture
inferredcites →https://doi.org/10.1016/b978-0-12-473750-1.50015-1openalex-snapshot
Geometric Inequalities
inferredcites →https://doi.org/10.1017/s030500410004305xopenalex-snapshot
An improved lower bound for the multidimensional dimer problem
inferredcites →https://doi.org/10.1215/s0012-7094-59-02606-7openalex-snapshot
On the minimum of the permanent of a doubly stochastic matrix
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21413openalex-snapshot
Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares
inferred← citeshttps://doi.org/10.1002/jcd.21603openalex-snapshot
On the number of SQSs, latin hypercubes and MDS codes
inferred← citeshttps://doi.org/10.1002/rsa.20487openalex-snapshot
An upper bound on the number of Steiner triple systems
inferred← citeshttps://doi.org/10.1006/jctb.1997.1798openalex-snapshot
Counting 1-Factors in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/11602613_58openalex-snapshot
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach
inferred← citeshttps://doi.org/10.1007/978-0-387-21696-6_6openalex-snapshot
Multi-Dimensional Capacity, Pressure and Hausdorff Dimension
inferred← citeshttps://doi.org/10.1007/978-3-662-57767-7_24openalex-snapshot
Van der Waerdens Permanenten-Vermutung
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/s00454-013-9554-5openalex-snapshot
On the Vertices of the d-Dimensional Birkhoff Polytope
inferred← citeshttps://doi.org/10.1007/s00493-004-0025-8openalex-snapshot
Triangle Factors In Sparse Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.1007/s00493-011-2842-8openalex-snapshot
An upper bound on the number of high-dimensional permutations
inferred← citeshttps://doi.org/10.1007/s00493-014-2842-8openalex-snapshot
An upper bound on the number of high-dimensional permutations
inferred← citeshttps://doi.org/10.1007/s10107-016-0998-2openalex-snapshot
Relative entropy optimization and its applications
inferred← citeshttps://doi.org/10.1007/s10955-011-0170-6openalex-snapshot
An Asymptotic Expansion and Recursive Inequalities for the Monomer-Dimer Problem
inferred← citeshttps://doi.org/10.1016/j.aim.2024.110079openalex-snapshot
On the codimension of permanental varieties
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.disc.2016.11.024openalex-snapshot
On the numbers of 1-factors and 1-factorizations of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.005openalex-snapshot
On the number of Sudoku squares
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112168openalex-snapshot
Paths with many shortcuts in tournaments
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.028openalex-snapshot
On maximum number of minimal dominating sets in graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.014openalex-snapshot
Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.12.002openalex-snapshot
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2026.03.010openalex-snapshot
Characterization of Erdős matrices by their zero entries
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80005-2openalex-snapshot
Van der Waerden Conjecture and Applications
inferred← citeshttps://doi.org/10.1017/s0963548307008747openalex-snapshot
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
inferred← citeshttps://doi.org/10.1017/s0963548321000122openalex-snapshot
Counting matchings via capacity-preserving operators
inferred← citeshttps://doi.org/10.1051/cocv:2008040openalex-snapshot
A new series of conjectures and open questions in optimization and matrix analysis
inferred← citeshttps://doi.org/10.1090/proc/17142openalex-snapshot
The number of symmetric chain decompositions
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0928962-9openalex-snapshot
Multinomial Probabilities, Permanents and a Conjecture of Karlin and Rinott
inferred← citeshttps://doi.org/10.1090/s0025-5718-04-01626-6openalex-snapshot
The Steiner triple systems of order 19
inferred← citeshttps://doi.org/10.1109/focs.2012.81openalex-snapshot
A Permanent Approach to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/isit.2015.7282752openalex-snapshot
Bounds on the size of balls over permutations with the infinity metric
inferred← citeshttps://doi.org/10.1134/s1990478913030113openalex-snapshot
On the steiner triple systems of small rank embedded into perfect binary codes
inferred← citeshttps://doi.org/10.1134/s1990478916040141openalex-snapshot
Permanents of multidimensional matrices: Properties and applications
inferred← citeshttps://doi.org/10.1137/120888168openalex-snapshot
Maximum Size of Reverse-Free Sets of Permutations
inferred← citeshttps://doi.org/10.1137/130916084openalex-snapshot
Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
inferred← citeshttps://doi.org/10.1145/1435375.1435384openalex-snapshot
Combinatorial bounds via measure and conquer
inferred← citeshttps://doi.org/10.1145/1993636.1993682openalex-snapshot
The computational complexity of linear optics
inferred← citeshttps://doi.org/10.13001/1081-3810.1577openalex-snapshot
Results and open problems in matchings in regular graphs
inferred← citeshttps://doi.org/10.14760/owr-2015-17openalex-snapshot
Arbeitsgemeinschaft: The Kadison-Singer Conjecture
inferred← citeshttps://doi.org/10.4169/000298910x523380openalex-snapshot
On Leonid Gurvits’s Proof for Permanents
inferred← citeshttps://doi.org/10.4310/joc.2021.v12.n2.a5openalex-snapshot
Dominant tournament families
inferred← citeshttps://doi.org/10.46298/dmtcs.2105openalex-snapshot
Extending a perfect matching to a Hamiltonian cycle
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3245openalex-snapshot
The Computational Complexity of Linear Optics
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2542openalex-snapshot
Analogs of the van der Waerden and Tverberg conjectures for haffnians
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0065openalex-snapshot
Approximating the Permanent with Fractional Belief Propagation
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5042openalex-snapshot
An Upper bound on the number of Steiner triple systems
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10726openalex-snapshot
The geometry of diagonal groups
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603410openalex-snapshot
Generalized Friedland-Tverberg inequality: applications and extensions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.