Boolean combinations of graphs
math.CO, cs.DM
Submitted: 2024-12-27
Updated: 2026-11-11
Terminology
Sources
- Path Odd-Covers of Graphs
- Adjacency Labeling Schemes for Small Classes
- Existential characterizations of monadic NIP
- On first-order transductions of classes of graphs
- First-Order Model Checking on Monadically Stable Graph Classes
- Partitioning perfect graphs into comparability graphs
- Cover numbers by certain graph families
- Induced subgraph density. VI. Bounded VC-dimension
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