← Back to all news
arXiv AI By Xinan Dai, Wenhao Deng, Yingdong Shi, Tailin Wu, Yuchen Yang

Self-complementary completions on six vertices

Read the original on arXiv AI →

arXiv:2609. 20231v1 Announce Type: cross Abstract: Let \(\cthreshold(n)\) be the largest integer \(q\) such that every loopless digraph on \(n\) vertices with at most \(q\) arcs is isomorphic to a spanning subdigraph of a self-complementary digraph of order \(n\).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Jul 14

Instruction Set and Language for Hypergraphs

arXiv:2607. 10194v1 Announce Type: cross Abstract: We present IsalHG, a method for representing the structure of any finite, connected hypergraph of bounded hyperedge arity as a string over a compact instruction alphabet $\Sigma_{\mathrm{HG}}$.

By Mario Pascual-Gonzalez, Ezequiel Lopez-Rubio
benchmarks
More like this →
arXiv AI
Sep 4

AutoGraphForge: Towards Automated Graph Theory Discovery

AutoGraphForge is a computational pipeline designed to automate the discovery, refutation, formalization, and proving of graph-theoretic conjectures. It generates conjectures using a Graffiti3 generator, filters out known results with a novelty filter, tests candidates against a large dataset of graphs, and refines surviving conjectures through counterexample search. The pipeline then translates each conjecture into Lean 4, verifies proofs with neural provers, and integrates the results into a formal library.

By J\'an Pastorek
More like this →
arXiv Machine Learning
Sep 10

Expressivity of Contradiction Graphs

arXiv:2605.20434v2 Announce Type: replace-cross Abstract: We study the contradiction graphs associated with a binary concept class. For a class $H\subseteq\{0,1\}^X$, the order-$m$ contradiction grap...

By Jesse Campbell, Daniel Ibaibarriaga, Lev Reyzin
More like this →