Colorings breaking prescribed families of graph automorphisms
math.CO
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Distinguishing regular graphs from lists
- Breaking small automorphisms of graphs of arbitrary cardinality
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality