Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative 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.
Computer-assisted proof that connected Cayley graphs on groups of order 8pq are Hamiltonian.
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
citing papers explorer
-
The Finite Length Property of the Rado Graph and Friends
Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
-
RLGT: A reinforcement learning framework for extremal graph theory
RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.
-
Cayley graphs of order 8pq are hamiltonian
Computer-assisted proof that connected Cayley graphs on groups of order 8pq are Hamiltonian.
-
End-to-end performance of quantum-accelerated large-scale linear algebra workflows
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.