The \(n\)-queens completion problem
From MaRDI portal
Publication:2157925
DOI10.1007/s40687-022-00335-1zbMath1493.05044arXiv2111.11402OpenAlexW3217699801MaRDI QIDQ2157925
Stefan Glock, David Munhá Correia, Benjamin Sudakov
Publication date: 22 July 2022
Published in: Research in the Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.11402
Linear programming (90C05) Combinatorial probability (60C05) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Lopsided Lovász Local lemma and Latin transversals
- Asymptotic behavior of the chromatic index for hypergraphs
- A survey of known results and research areas for \(n\)-queens
- An approximate version of a conjecture of Aharoni and Berger
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Asymptotically good list-colorings
- Completion and deficiency problems
- Embedding rainbow trees with applications to graph labelling and decomposition
- Decompositions into isomorphic rainbow spanning trees
- A proof of Ringel's conjecture
- Rainbow factors in hypergraphs
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Thank Evans!
- Embedding Incomplete Latin Squares
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- The n-Queens Problem
- Near-optimal list colorings
- Proofs from THE BOOK
- Decompositions into spanning rainbow structures
- New bounds for Ryser’s conjecture and related problems
- Rainbow structures in locally bounded colorings of graphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- On the threshold problem for Latin boxes
- Rainbow matchings in Dirac bipartite graphs
- Complexity of n-Queens Completion
- Full rainbow matchings in graphs and hypergraphs
This page was built for publication: The \(n\)-queens completion problem
