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

arXiv:2605.02193v1 Announce Type: cross 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.

Source: arXiv cs.LG | 2026-05-05