A spinorial formulation of the maximum clique problem of a graph

DOI10.1063/1.2186256zbMath1111.05073arXivmath-ph/0603068OpenAlexW1496991960MaRDI QIDQ3441737

Marco Budinich, Paolo Budinich

Publication date: 16 May 2007

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math-ph/0603068

Mathematics Subject Classification ID

Spinor and twistor methods applied to problems in quantum theory (81R25) Clifford algebras, spinors (15A66) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Zeons, orthozeons, and graph colorings, Laplace and Dirac operators on graphs, Spinorial formulations of graph problems, On computational complexity of Clifford algebra, Hamiltonian cycle enumeration via fermion-zeon convolution, Block linear majorants in quadratic 0--1 optimization, Zeon and idem-Clifford formulations of Boolean satisfiability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to the spinorial chessboard
• The maximum clique problem
• Noncommutative geometry and gauge theory on discrete groups
• Evolution towards the maximum clique
• Exact bounds on the order of the maximum clique of a graph.
• A global optimization approach for solving the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• Fock space description of simple spinors
• Maxima for Graphs and a New Proof of a Theorem of Turán