Siyue Liu

activity

20232026

most citedApproximately Packing Dijoins via Nowhere-Zero Flows

1 citations · 1 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Feedback edge set in bipartite digraph

Bin Chen, Jianfeng Hou, Siyue Liu

Let $β(G)$ denote the minimum size of a feedback edge set of a digraph $G$, and let $γ(G)$ denote the number of unordered pairs of nonadjacent vertices. Motivated by the Chud…

math.CO2026

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations

Siyue Liu, Olha Silina

Let $G = (V, E^{+} \cup E^{-})$ be a bidirected graph whose underlying undirected graph $G = (V, E)$ is $2$ -edge-connected. A strongly connected orientation (SCO) is defined as a subset…

math.CO2025

A Min-Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Gérard Cornuéjols, Siyue Liu, R. Ravi

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted…

math.CO2024

Strongly connected orientations and integer lattices

Ahmad Abdi, Gérard Cornuéjols, Siyue Liu +1

Let $D = (V, A)$ be a digraph whose underlying undirected graph is $2$ -edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal…

math.CO2023

On the Congruency-Constrained Matroid Base

Siyue Liu, Chao Xu

Consider a matroid where all elements are labeled with an element in $Z$ . We are interested in finding a base where the sum of the labels is congruent to $g (mod m)$ . We s…

math.CO2023★ 1 cited

Approximately Packing Dijoins via Nowhere-Zero Flows

Gérard Cornuéjols, Siyue Liu, R. Ravi

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph…