A complete resolution of the Keller maximum clique problem

MaRDI QIDQ5365030zbMATH OpenFDO

Authors Jennifer Debroni, John D. Eblen, Michael A. Langston, Dinesh Weerapurage, Wendy Myrvold, Peter W. Shor

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133047

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Extended Keller graph and its properties
• A fast algorithm for the maximum clique problem
• The maximum clique problem
• Finding a Maximum Clique in an Arbitrary Graph
• An exact algorithm for the maximum clique problem

Cited in

(17)

• Rigid polyboxes and Keller's conjecture
• Towards resolving Keller's cube tiling conjecture in dimension seven
• On the structure of cube tiling codes
• Tiling \(\mathbb R^5\) by crosses
• A simple solution to the k‐core problem
• Enumerating cube tilings
• Partitions and balanced matchings of an n-dimensional cube
• Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
• On Keller's conjecture in dimension seven
• New results on torus cube packings and tilings
• The structure of cube tilings
• Keller's conjecture revisited
• Extended Keller graph and its properties
• The resolution of Keller's conjecture
• The resolution of Keller's conjecture
• scientific article; zbMATH DE number 7793076 (Why is no real title available?)
• Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses

This page was built for publication: A complete resolution of the Keller maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365030)