1 Introduction Given a graph , a cut of is the edge set between nonempty sets and . The sets and are partition classes (or, parts). A bisection is a cut in which the sizes of its parts differ by at most 1. A 3-regular graph is called cubic and a graph of maximum degree at most 3 is subcubic. The following result is well known (see, e.g., [1]) and the bound is tight for and . Theorem 1.1.Every subcubic graph has a cut with at least edges.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Anders Yeo
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
G.Gutin, H.Lei, A.Yeo, and Y.Zhou, “Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree,” Journal of Graph Theory0 (2026): 1-12. https://doi.org/10.1002/jgt.70038. Data Availability Statement The authors have nothing to report. References 1 and , “ Basic Terminology, Notation and Results,” in Classes of Directed Graphs, Springer Monographs in Mathematics, eds. J. Bang-Jensen and G. Z. Gutin (Springer, 2018).
Domination in 4‐Regular Graphs With No Induced 4‐Cycles
Proof.Suppose, to the contrary, that the theorem is false. Among all counterexample to Theorem 6, let G $G$ be chosen so that ∣ V ( G ) ∣ + ∣ E ( G ) ∣ $| V(G)| +| E(G)| $ is a minimum and, subject to this condition, the number of marked vertices is a minimum. We will frequently use the following fact.
[2511.11475] Public Goods Games in Directed Networks with Constraints on Sharing
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2407.17051] Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
The arXiv Accessibility Forum takes place this September. Free, fully remote and open to all. Learn more and spread the word.
[2401.10074] Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
[Submitted on 18 Jan 2024 ( v1 ), last revised 22 Jan 2024 (this version, v2)] Title:Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees Download a PDF of the paper titled Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees, by Stefanie Gerke and 2 other authors Download PDF Abstract:A bisection in a graph is a cut in which the number of vertices in the two parts differ by at most 1.
Transversals in regular uniform hypergraphs
The transversal number τ ( H ) $\tau (H)$ of a hypergraph H $H$ is the minimum number of vertices that intersect every edge of H $H$ . This notion of transversal is fundamental in hypergraph theory and has been studied a great deal in the literature. A hypergraph H $H$ is r $r$ -regular if every vertex of H $H$ has degree r $r$ , that is, every vertex of H $H$ belongs to exactly r $r$ edges.
[2305.07124] Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
arXiv:2305.07124 (cs) Download a PDF of the paper titled Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems, by Argyrios Deligkas and 4 other authors Download PDF Submission history From: Eduard Eiben [ view email] [v1] Thu, 11 May 2023 20:27:12 UTC (73 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart...
[2304.10202] Bounds on Maximum Weight Directed Cut
We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum size of a directed cut in unweighted digraphs.
[2210.07722] (1,1)-Cluster Editing is Polynomial-time Solvable
[Submitted on 14 Oct 2022 ( v1 ), last revised 4 Jul 2023 (this version, v2)] Title:(1,1)-Cluster Editing is Polynomial-time Solvable Download a PDF of the paper titled (1,1)-Cluster Editing is Polynomial-time Solvable, by Gregory Gutin and Anders Yeo Download PDF Abstract: A graph $H$ is a clique graph if $H$ is a vertex-disjoin union of cliques.
[2104.05536] Lower Bounds for Maximum Weighted Cut
arXiv:2104.05536 (math) [Submitted on 12 Apr 2021 (v1), last revised 4 Jul 2023 (this version, v3)] Download a PDF of the paper titled Lower Bounds for Maximum Weighted Cut, by Gregory Gutin and Anders Yeo Download PDF Submission history From: Gregory Gutin [ view email] [v1] Mon, 12 Apr 2021 15:07:05 UTC (21 KB) [v2] Wed, 23 Mar 2022 08:57:33 UTC (24 KB) [v3] Tue, 4 Jul 2023 08:18:20 UTC (25 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle...
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Anders
Contact Anders, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack