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
and Piperno, Adolfo , TITLE =
10 Pith papers cite this work. Polarity classification is still indexing.
10
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.
An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.
Defines a canonical labelling function for finite solvable groups via presentations and cohomology so that can(G) equals can(H) exactly when G and H are isomorphic.
Proves if-and-only-if equivalences for toric ring normality and quadratic toric ideal generation between anti-blocking lattice polytopes and their unconditional reflections, plus a graph-theoretic characterization of quadratic symmetric stable set ideals.
The Quad-C5 graph, built from four overlapping KCBS pentagons, is the maximum-gap contextuality witness on eight vertices and is already contextual for a single qutrit.
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.
Enumeration of extreme points of the subtour polytope for metric TSP is extended to 14 vertices, identifying missing points for n=11 and n=12.
SeQuant introduces a graph-theoretic tensor network canonicalizer for efficient symbolic manipulation and numerical evaluation of tensors over commutative and non-commutative rings, with support for noncovariant and nested tensors.
Maniplexes are positioned as a unifying combinatorial structure with a proposed edge-labeled graph storage format, demonstrated by linking two regular 4-maniplex datasets to existing graph censuses via canonical forms.
citing papers explorer
-
Some results on small ordered and cyclic Ramsey numbers
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
-
Generation of Cycle Permutation Graphs and Permutation Snarks
An algorithm generates all cycle permutation graphs up to order 34 and permutation snarks up to 46, completing the characterization of orders for non-hamiltonian cycle permutation graphs.
-
Algebraic aspects of unconditional lattice polytopes
Proves if-and-only-if equivalences for toric ring normality and quadratic toric ideal generation between anti-blocking lattice polytopes and their unconditional reflections, plus a graph-theoretic characterization of quadratic symmetric stable set ideals.
-
Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$
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.
-
Extending Exact Integrality Gap Computations for the Metric TSP
Enumeration of extreme points of the subtour polytope for metric TSP is extended to 14 vertices, identifying missing points for n=11 and n=12.
-
Maniplexes as a Foundation for Cross-Linked Databases of Symmetric Objects
Maniplexes are positioned as a unifying combinatorial structure with a proposed edge-labeled graph storage format, demonstrated by linking two regular 4-maniplex datasets to existing graph censuses via canonical forms.