The Quad-C5 graph on eight vertices maximizes the contextuality gap at 0.46784 and witnesses qutrit contextuality with value 1 + sqrt(5).
and Piperno, Adolfo , TITLE =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
Gorenstein simplices with the given h*-polynomial are classified up to unimodular equivalence by strict divisor chains in the divisor lattice of v, yielding an explicit counting formula.
citing papers explorer
-
The Quad-$C_5$ Graph: Maximum Contextuality Gap on Eight Vertices
The Quad-C5 graph on eight vertices maximizes the contextuality gap at 0.46784 and witnesses qutrit contextuality with value 1 + sqrt(5).