Increasing arc-connectivity by bounded- and fixed-size inversions
math.CO, cs.DM
Submitted: 2026-04-24
Updated: 2026-11-18
Terminology
Sources
- Inversion diameter and 2-edge-colored homomorphisms
- Making an oriented graph acyclic using inversions of bounded or prescribed size
- A case of the dijoin conjecture on inverting oriented graphs
- Edge-Number Bounds for the Inversion Diameter of Graphs
- On the $(\leq p)$-inversion diameter of oriented graphs
- The inversion number of dijoins and blow-up digraphs
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