Nov 6, 2023 · This work studies a central extremal graph theory problem inspired by a 1975 conjecture of Erdős, which aims to find graphs with a given size.

This work proposes a new learning-to-search bench- mark and uses AI to discover new mathematical knowledge related to an open conjecture of Erd˝os. (1975) in ...

Start from empty graph and add nodes one by one (short horizon, large action space). ○ Start from empty graph and add edges one by one (large horizon,.

Nov 6, 2023 · This work studies a central extremal graph theory problem inspired by a 1975 conjecture of Erdos, which aims to find graphs with a given size ( ...

Aug 3, 2024 · This work proposes a new learning-to-search benchmark and uses AI to discover new mathematical knowledge related to an open conjecture of Erdos (1975) in ...

Nov 6, 2023 · This work proposes a new learning-to-search benchmark and uses AI to discover new mathematical knowledge related to an open conjecture of ...

Nov 8, 2023 · Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. This work studies a central extremal graph theory problem inspired ...

Nov 14, 2023 · Bibliographic details on Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search.

Nov 9, 2023 · We used old-school (Tabu search) and new-school (AlphaZero) AI to discover new constructions in graph theory! To appear at the NeurIPS 2023 ...

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe ...