Strong orientation of a connected graph for a crossing family

Abdi, Ahmad ORCID: 0000-0002-3008-4167, Dalirrooyfarda, Mahsa and Neuwohner, Meike ORCID: 0000-0002-3664-3687 (2025) Strong orientation of a connected graph for a crossing family. Operations Research Letters, 62. ISSN 0167-6377

Text (Tree_Orientation) - Accepted Version Available under License Creative Commons Attribution. Download (311kB)

• Scopus publication

Abstract

Given a connected graph G = (V , E) and a crossing family C over ground set V such that | δ G ( U ) | ≥ 2 for every U ∈ C , we prove there exists a strong orientation of G for C , i.e., an orientation of G such that each set in C has at least one outgoing and at least one incoming arc. This implies the main conjecture in Chudnovsky et al. (2016) [3].

Item Type:	Article
Additional Information:	© 2025 Published by Elsevier B.V.
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	08 Apr 2025 14:09
Last Modified:	30 Oct 2025 20:24
URI:	http://eprints.lse.ac.uk/id/eprint/127859

Actions (login required)

View Item