Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools

Alina Du; Steven Heilman; Greta Panova

math.COMay 4, 2026

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools

Authors: Alina Du, Steven Heilman, Greta Panova

Organizations: Department of Mathematics, University of Southern California, Los Angeles, CA 90089.

Abstract

We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement learning software developed by Charton-Ellenberg-Wagner-Williamson. We also show: for any positive integer $m$ , there exists a tree whose dominating set sequence is not log-concave for at least $m$ indices by modifying a similar construction of Bautista-Ramos for the independent set sequence. We show that a large class of caterpillar graphs has log-concave dominating set sequences. A continuous analogue of the sequence is also log-concave for all graphs.

Explore similar work

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs
Sep 14, 2026Zixiang Xu, Yanbo Wang, Chenxi Wang +6Graph Representations Large Reasoning Models
Literati: Towards Anytime Optimal Shape Generalized Trees via AO*
Sep 8, 2026Nakul Upadhya, Eldan CohenDecision Trees Literature
Reinforced Graph of Thoughts: RL-Driven Adaptive Prompting for LLMs
May 21, 2026Manuel Noah Riesen, Peter Alfred von NiederhäusernLarge Language Model Reasoning Tree-Of-Thoughts

Sep 14, 2026 · cs.AIJ/K move · Enter open · S save

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

Zixiang Xu, Yanbo Wang, Chenxi Wang, Lang Gao+5

Large Language Models (LLMs) are increasingly asked to reason over structured data such as graphs, yet how reliably they can carry out multi-step graph algorithms in language remains unclear. Existing evaluations tend to use simple tasks on small graphs, to score code generation rather than reasoning over the graph itself, or to fix a single input format. We introduce Graph Theory Bench (GT Bench), a benchmark covering 24 classical graph problems in 44 task-structure settings, with over 100,000 examples across four representations: natural language, structured language, adjacency list, and adjacency matrix. Evaluating eight LLMs on GT Bench shows that accuracy is strongly tied to the input representation, that the best representation shifts with graph density, size, and topology as well as with the model, and that this sensitivity persists, attenuated, in the strongest reasoning models. Building on these observations, we propose the Graph Theory Agent (GTA), which pairs a preference-trained representation selector with plan-and-decompose scaffolding around a frozen executor LLM. GTA lifts Phi-4 from 53.5% to 69.1% on the benchmark's easy split and from 33.0% to 41.5% on its hard split, outperforming eight prompting and agent baselines, and transfers without retraining to GraCoRe and NLGraph. Code for benchmark generation and evaluation: https://github.com/xzx34/GTA. The project homepage is available at https://xzx34.github.io/gta/.

Graph Representations Large Reasoning Models Code Generation

Open paper Ask about it PDF

Abstract

Explore similar work

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

Literati: Towards Anytime Optimal Shape Generalized Trees via AO*

Reinforced Graph of Thoughts: RL-Driven Adaptive Prompting for LLMs