Searcharxiv⌕ Search

arXiv subjects

Anders Yeo

Publications and source records attributed to Anders Yeo.

At least 19 recordsLinked to original sources

Sharp lower bounds for weighted bisections of graphs with bounded maximum degree

A bisection of a graph is a partition of its vertex set into two parts the sizes of which differ by at most one. We prove that every finite simple graph of maximum degree at most an odd positive integer $k$, with arbitrary nonnegative real edge weights, has a bisection of weight at least $(k+1)/(2k)$ times its total edge weight. The corresponding bound $(k+2)/(2(k+1))$ for even $k$ follows immediately. Both coefficients are best possible. Somewhat surprisingly, these are exactly the sharp coefficients known for maximum weighted cuts, despite the additional balance requirement.

math.CO↗

Acyclic orientations of mixed graphs

A mixed graph $M=(V,E\cup A)$ is acyclic if its directed part $(V,A)$ is an acyclic digraph. In this note we study the so-called orientation completion problem for the class of acyclic mixed graphs. That is, given an acyclic mixed graph $M$ and a property ${\cal P}$; can we orient the edges of $M$ so that the resulting digraph is acyclic and has property ${\cal P}$. We prove that one can decide in polynomial time whether $M$ can be completed to an acyclic digraph with an out-branching from a prescibed vertex $s$, while it is NP-complete to decide whether $M$ has an acyclic orientation which has both an out-branching and an in-branching (a bipolar orientation). We show that it is NP-complete to decide whether $M$ can be oriented so that it contains a directed path between two prescribed vertices. Finally we describe a polynomial algorithm for deciding whether an acyclic digraph $D$ has an out-branching $B^+_s$ such that the digraph $D-A(B^+_s)$ is connected (in the underlying sense). Based on this we pose as an open problem the complexity of deciding whether the edges of an acyclic mixed graph can be oriented so that the result is an acyclic digraph with a non-separating out-branching.

math.CO↗

On Seymour's and Sullivan's Second Neighbourhood Conjectures

For a vertex $x$ of a digraph, $d^+(x)$ ($d^-(x)$, resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++}(x)$ is the number of vertices at distance 2 from $x$. In 1995, Seymour conjectured that for any oriented graph $D$ there exists a vertex $x$ such that $d^+(x)\leq d^{++}(x)$. In 2006, Sullivan conjectured that there exists a vertex $x$ in $D$ such that $d^-(x)\leq d^{++}(x)$. We give a sufficient condition in terms of the number of transitive triangles for an oriented graph to satisfy Sullivan's conjecture. In particular, this implies that Sullivan's conjecture holds for all orientations of planar graphs and of triangle-free graphs. An oriented graph $D$ is an oriented split graph if the vertices of $D$ can be partitioned into vertex sets $X$ and $Y$ such that $X$ is an independent set and $Y$ induces a tournament. We also show that the two conjectures hold for some families of oriented split graphs, in particular, when $Y$ induces a regular or an almost regular tournament.

math.CO↗

Note on the size of a stable matching

Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains $n$ pairs. We show that the number of workers employed and positions filled in every stable matching is bounded from below by $\lceil\frac{n}{2}\rceil$ and we characterise the class of preferences that attain the bound. We then identify the minimum number of equilibrium pairings that must be ``sacrificed'' when maximising the employment rate is the objective; if each stable matching is of size $\ceiling{\frac{n}{2}}$, then no such pairs appear when all vacancies are filled.

econ.TH↗

Large induced subgraphs with prescribed degree parity

A long-standing conjecture of Caro (Discrete Math, 1994), confirmed by Ferber and Krivelevich (Adv Math, 2022), states that every $n$-vertex graph $G$ without isolated vertices contains an induced subgraph of order linear in $n$ in which every vertex has odd degree. We generalize this result to graphs $G$ whose vertices are labeled by $\ell: V(G)\to \{0,1\}$. We require, in an induced subgraph, all $0$-labeled vertices to have even degree and all $1$-labeled vertices to have odd degree. Let $h_{\ell}(G)$ denote the maximum order of such a subgraph. Let $f_{oe}(G)=\min_{\ell} h_{\ell}(G)$ be the worst-labeling parameter. We establish a pointwise lower bound for $h_{\ell}(G)$ that immediately yields a linear lower bound in $|V(G)|$ for $f_{oe}(G)$, where $G$ has no isolated vertices. For an $n$-vertex connected graph, we obtain a sharp lower bound for $f_{oe}(G)$: $f_{oe}(G)\ge \lceil (n-1)/χ_{mm}{(G)} \rceil ,$ where $χ_{mm}{(G)}$ is the maximum chromatic number of a minor of $G.$ Using proved cases of Hadwiger's Conjecture, we show that for $t\in \{3,4,5,6\}$, if an $n$-vertex connected graph $G$ is $K_t$-minor-free, then $f_{oe}(G)\ge \lceil (n-1)/(t-1)\rceil$ and this bound is sharp for each $t\in \{3,4,5,6\}$. Finally, we conjecture that $f_{oe}(G)\ge f_o(G)/2$ for all graphs $G$ and confirm the conjecture for all trees and complete multipartite graphs.

math.CO↗

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition

Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graphs. They conjectured the following extension of Dirac's theorem: If $D$ is an oriented graph on $n \ge 3$ vertices with minimum degree $δ(D) \ge n/ 2$, then $D$ contains a Hamilton oriented cycle with at least $δ(D)$ arcs in the same direction. This conjecture was proved by Freschi and Lo (2024) who posed an open problem to extend their result to an Ore-type condition. We propose two conjectures for such extensions and prove results which provide support to the conjectures.

math.CO↗

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs

Let $D=(V(D),A(D))$ be a digraph with at least one directed cycle. A set $F$ of arcs is a feedback arc set (FAS) if $D-F$ has no directed cycle. The FAS decomposition number ${\rm fasd}(D)$ of $D$ is the maximum number of pairwise disjoint FASs whose union is $A(D)$. The directed girth $g(D)$ of $D$ is the minimum length of a directed cycle of $D$. Note that ${\rm fasd}(D)\le g(D).$ The FAS decomposition number appears in the well-known and far-from-solved conjecture of Woodall (1978) stating that for every planar digraph $D$ with at least one directed cycle, ${\rm fasd}(D)=g(D).$ The degree of a vertex of $D$ is the sum of its in-degree and out-degree. Let $D$ be an arc-weighted digraph and let ${\rm fas}_w(D)$ denote the minimum weight of its FAS. In this paper, we study bounds on ${\rm fasd}(D)$, ${\rm fas}_w(D)$ and ${\rm fas}(D)$ for arc-weighted oriented graphs $D$ (i.e., digraphs without opposite arcs) with upper-bounded maximum degree $Δ(D)$ and lower-bounded $g(D)$. Note that these parameters are related: ${\rm fas}_w(D)\le w(D)/{\rm fasd}(D)$, where $w(D)$ is the total weight of $D$, and ${\rm fas}(D)\le |A(D)|/{\rm fasd}(D).$ In particular, we prove the following: (i) If $Δ(D)\leq~4$ and $g(D)\geq 3$, then ${\rm fasd}(D) \geq 3$ and therefore ${\rm fas}_w(D)\leq \frac{w(D)}{3}$ which generalizes a known tight bound for an unweighted oriented graph with maximum degree at most 4; (ii) If $Δ(D)\leq 3$ and $g(D)\in \{3,4,5\}$, then ${\rm fasd}(D)=g(D)$; (iii) If $Δ(D)\leq 3$ and $g(D)\ge 8$ then ${\rm fasd}(D)<g(D).$ We also give some bounds for the cases when $Δ$ or $g$ are large and state several open problems and a conjecture.

math.CO↗

Feedback vertex sets of digraphs with bounded maximum degree

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$ makes it acyclic. Let $D$ be a digraph with $n$ vertices and maximum degree $Δ$. We prove the following bounds. If $D$ is an oriented graph, then $fvs(D)\leq \frac{3n}{7}$ when $Δ\le 4$ and $fvs(D)\leq \frac{n}{2}$ when $Δ\le 5$. If $D$ is a connected digraph, $Δ\le 4$ and $D$ is not obtained from an odd undirected cycle by replacing every edge with the pair of opposite arcs with the same endvertices, then $fvs(D)\leq \frac{n}{2}$. If $D$ is an arbitrary digraph with $Δ\le 5$ then $fvs(D)\leq \frac{2n}{3}.$ Note that all the above bounds are tight.

math.CO↗

Acyclic dichromatic number of oriented graphs

The dichromatic number $\vecχ(D)$ of a digraph $D=(V,A)$ is the minimum number of sets in a partition $V_1,\ldots{},V_k$ of $V$ into $k$ subsets so that the induced subdigraph $D[V_i]$ is acyclic for each $i\in [k]$. This is a generalization of the chromatic number for undirected graphs as a graph has chromatic number at most $k$ if and only if the complete biorientation of $G$ (replace each edge by a directed 2-cycle) has dichromatic number at most $k$. In this paper we introduce the acyclic dichromatic number $\vecχ_{\rm a}(D)$ of a digraph $D$ as the minimum number of sets in a partition $V_1,\ldots{},V_k$ of $V$ so that the induced subdigraph $D[V_i]$ is acyclic for each $i\in [k]$ and each of the bipartite induced subdigraphs $D[V_i,V_j]$ is acyclic for each $1\leq i<j\leq k$. This parameter, which resembles the definition of acyclic chromatic number for undirected graphs, has apparently not been studied before. We derive a number of results which display the difference between the dichromatic number and the acyclic dichromatic number, in particular, there are digraphs $D$ with arbitrarily large $\vecχ_{\rm a}(D)-\vecχ(D)$, even among tournaments with dichromatic number 2 and bipartite tournaments (where the dichromatic number is always 2). We prove several complexity results, including that deciding whether $\vecχ_{\rm a}(D)\leq 2$ is NP-complete already for bipartite digraphs, while it is polynomial for tournaments (contrary to the case for dichromatic number). We also generalize the concept of heroes of a tournament to acyclic heroes of tournaments.

math.CO↗

Odd Induced Subgraphs in Graphs of Maximum Degree Four

A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant $c$ such that every $n$-vertex graph without isolated vertices contains an odd induced subgraph on at least $cn$ vertices. In 2022, Ferber and Krivelevich resolved this conjecture affirmatively with $c=10^{-4}$. A natural question is to determine the largest possible constant $c$. In 1994, Caro remarked that if $2/7$ is a valid value for $c$, then it is the largest possible one. To the best of our knowledge, the bound $c\ge 2/7$ has not been improved. Previous research has established tight bounds for specific graph classes -- for instance, $c = 2/5$ for graphs with maximum degree at most $3$ and without isolated vertices. In this paper, we prove that $c=2/7$ is the tight bound for graphs with maximum degree at most $4$ and without isolated vertices. Our result provides some support for $2/7$ being the largest value of $c$.

math.CO↗

Public Goods Games in Directed Networks with Constraints on Sharing

In a public goods game, every player chooses whether or not to buy a good that all neighboring players will have access to. We consider a setting in which the good is indivisible, neighboring players are out-neighbors in a directed graph, and there is a capacity constraint on their number, k, that can benefit from the good. This means that each player makes a two-pronged decision: decide whether or not to buy and, conditional on buying, choose which k out-neighbors to share access. We examine both pure and mixed Nash equilibria in the model from the perspective of existence, computation, and efficiency. We perform a comprehensive study for these three dimensions with respect to both sharing capacity (k) and the network structure (the underlying directed graph), and establish sharp complexity dichotomies for each.

cs.GT↗

Note on Long Directed Cycles in Eulerian Digraphs

Huang, Ma, Shapira, Sudakov and Yuster (Comb. Prob. Comput. 2013) proved that every Eulerian digraph of average out-degree $d$ has a directed cycle of length at least $\sqrt{d}.$ We improve the lower bound from $\sqrt{d}$ to $\sqrt{2d}-3/2.$

math.CO↗

Vertex-partitions of 2-edge-colored graphs

A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same color as itself. Majority colorings have received much attention in the last years and many interesting open problems remain. Inspired by this and the fact that digraphs can be modelled via 2-edge-colored graphs we study several problems concerning vertex partitions of 2-edge-colored graphs. In particular we study vertex partitions with the property that for each $c=1,2$ every vertex $v$ has least as many edges of colour $c$ to vertices outside the set it belongs to as it has to vertices inside its own set. We call such a vertex partition with $k$ sets a {\bf $\mathbf{k}$-majority partition. Among other things we show that every 2-edge-coloured graph has a 4-majority partition and that it is NP-complete to decide whether a 2-edge-coloured graph has a 3-majority partition. We also apply probabilistic tools to show that every $2$-edge-colored graph $G$ of minimum color-degree $δ$ and maximum degree $Δ\le \frac{e^{δ/18}}{9δ}-2$ has a balanced majority $3$-partition.

math.CO↗

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree

An oriented multigraph is a directed multigraph without directed 2-cycles. Let ${\rm fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph $D$. The degree of a vertex is the sum of its out- and in-degrees. In several papers, upper bounds for ${\rm fas}(D)$ were obtained for oriented multigraphs $D$ with maximum degree upper-bounded by a constant. Hanauer (2017) conjectured that ${\rm fas}(D)\le 2.5n/3$ for every oriented multigraph $D$ with $n$ vertices and maximum degree at most 5. We prove a strengthening of the conjecture: ${\rm fas}(D)\le m/3$ holds for every oriented multigraph $D$ with $m$ arcs and maximum degree at most 5. This bound is tight and improves a bound of Berger and Shor (1990,1997). It would be interesting to determine $c$ such that ${\rm fas}(D)\le cn$ for every oriented multigraph $D$ with $n$ vertices and maximum degree at most 5 such that the bound is tight. We show that $\frac{5}{7}\le c \le \frac{24}{29} < \frac{2.5}{3}$.

math.CO↗

Speeding up deferred acceptance

A run of the deferred acceptance (DA) algorithm may contain proposals that are sure to be rejected. We introduce the accelerated deferred acceptance algorithm that proceeds in a similar manner to DA but with sure-to-be rejected proposals ruled out. Accelerated deferred acceptance outputs the same stable matching as DA but does so more efficiently: it terminates in weakly fewer rounds, requires weakly fewer proposals, and final pairs match no later. Computational experiments show that these efficiency savings can be strict.

econ.TH↗

Lower Bounds for Maximum Weighted Cut

While there have been many results on lower bounds for Max Cut in unweighted graphs, there are only few results for lower bounds for Max Cut in weighted graphs. In this paper, we launch an extensive study of lower bounds for Max Cut in weighted graphs. We introduce a new approach for obtaining lower bounds for Weighted Max Cut. Using it, Probabilistic Method, Vizing's chromatic index theorem, and other tools, we obtain several lower bounds for arbitrary weighted graphs, weighted graphs of bounded girth and triangle-free weighted graphs. We pose conjectures and open questions.

math.CO↗

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

An oriented graph $D$ is converse invariant if, for any tournament $T$, the number of copies of $D$ in $T$ is equal to that of its converse $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684-701] showed that any oriented graph $D$ with maximum degree at most 2 is converse invariant. They proposed a question: Can we characterize all converse invariant oriented graphs? In this paper, we introduce a digraph polynomial and employ it to give a necessary condition for an oriented graph to be converse invariant. This polynomial serves as a cornerstone in proving all the results presented in this paper. In particular, we characterize all orientations of trees with diameter at most 3 that are converse invariant. We also show that all orientations of regular graphs are not converse invariant if $D$ and $-D$ have different degree sequences. In addition, in contrast to the findings of El Sahili and Ghazo Hanna, we prove that every connected graph $G$ with maximum degree at least $3$, admits an orientation $D$ of $G$ such that $D$ is not converse invariant. We pose one conjecture.

math.CO↗

Finding all stable matchings with assignment constraints

In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main contribution is an algorithm, based on the iterated deletion of unattractive alternatives, that determines if assignment constraints are compatible with stability. Whenever there is a stable matching that satisfies the assignment constraints, our algorithm outputs all of them (each in polynomial time per solution). This provides market designers with (i) a tool to test the feasibility of stable matchings subject to assignment constraints, and (ii) a tool to implement them when feasible.

econ.TH↗