Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
math.CO, cs.CC
Submitted: 2025-02-11
Updated: 2026-11-17
Terminology
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