4 papers
math.CO2026
A Counterexample to the Alon-Krivelevich Conjecture and a New Lower Bound for Choosability of Bipartite Graphs
Junran Yu, Gexin Yu
For an integer and , we construct a bipartite graph whose two vertex classes are disjoint copies of the family of all -subsets of a -…
cond-mat.mtrl-sci2026
DiffGA: Steering Frozen Diffusion Models for Materials Design via Evolutionary Search
Shivang Agarwal, Rodrigo Wang, Kevin Ryczko +1
Steering candidate generation toward user-defined objectives is central to inverse materials design, yet remains difficult when objectives are black-box, changing, or non-different…
math.CO2026
Perfect divisibility and perfect-Pollyanna in bull-free graphs
Ran Chen, Paras Vinubhai Maniya, Di Wu +1
A graph is {\em perfectly divisible} if, for each induced subgraph of , can be partitioned into and such that is perfect and . A {\em…
math.CO2025
On Perfect Divisibility of Bull-Free Graphs Without Long Paths
Ran Chen, Di Wu, Junran Yu +1
A graph is {\em perfectly divisible} if, for every induced subgraph of , can be partitioned into and such that is perfect and . Chudn…