English

Maximum directed cuts in digraphs with degree restriction

Discrete Mathematics 2007-11-29 v1
Authors: Jenö Lehel , Frédéric Maffray , Myriam Preissmann
View on arXiv ↗ PDF ↗

Abstract

For integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.

Keywords

planar graph drawing

Cite

@article{arxiv.0711.3958,
  title  = {Maximum directed cuts in digraphs with degree restriction},
  author = {Jenö Lehel and Frédéric Maffray and Myriam Preissmann},
  journal= {arXiv preprint arXiv:0711.3958},
  year   = {2007}
}

Related papers

View all related →
Combinatorics · Mathematics
On the size of maximum cut in planar graphs
Pranay Gorantla, Santhoshini Velusamy
2023-01-26
Combinatorics · Mathematics
Covering the edges of digraphs in $\mathscr{D}(3,3)$ and $\mathscr{D}(4,4)$ with directed cuts
Yandong Bai, Binlong Li, Shenggui Zhang
2012-02-06
Combinatorics · Mathematics
Bounds on Maximum Weight Directed Cut
Jiangdong Ai, Stefanie Gerke, Gregory Gutin, Anders Yeo +1
2023-04-21
Computer Science and Game Theory · Computer Science
Optimal Impartial Correspondences
Javier Cembrano, Felix Fischer, Max Klimm
2023-01-12
Data Structures and Algorithms · Computer Science
Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
Pavel Arkhipov, Vladimir Kolmogorov
2025-10-16
Combinatorics · Mathematics
A revised Moore bound for mixed graphs
Dominique Buset, Mourad El Amiri, Grahame Erskine, Hebert Pérez-Rosés +1
2016-05-03
Combinatorics · Mathematics
Nearly tight bounds for MaxCut in hypergraphs
Oliver Janzer, Julien Portier
2025-11-12
Data Structures and Algorithms · Computer Science
Cutwidth Bounds via Vertex Partitions
Antoine Amarilli, Benoît Groz
2025-04-04
Combinatorics · Mathematics
Digraphs with a fixed number of edges and vertices, having a maximal number of walks of length 2
Jan Snellman
2008-05-29
Combinatorics · Mathematics
The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh
Mirka Miller, Hebert Perez-Roses, Joe Ryan
2012-03-20
Data Structures and Algorithms · Computer Science
Better Algorithms and Bounds for Directed Maximum Leaf Problems
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich +1
2007-07-10
Combinatorics · Mathematics
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou
2024-01-23
Combinatorics · Mathematics
On the reciprocal degree distance of graphs with cut vertices or edges
Xiao-Xin Li
2015-03-12
Combinatorics · Mathematics
Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size
Niraj Khare, Nishali Mehta, Naushad Puliyambalath
2012-03-08
Combinatorics · Mathematics
Cut covers of acyclic digraphs
Maximilian Krone
2024-10-10
Combinatorics · Mathematics
Bisections of graphs
Choongbum Lee, Po-Shen Loh, Benny Sudakov
2013-05-29
Combinatorics · Mathematics
Enumeration of dihypergraphs with specified degrees and edge types
Catherine Greenhill, Tamás Makai
2026-04-14
Combinatorics · Mathematics
The degree-diameter problem for sparse graph classes
Guillermo Pineda-Villavicencio, David R. Wood
2017-04-18
Combinatorics · Mathematics
On the maximum number of edges of outer k-planar graphs
Maximilian Pfister
2025-06-02
Computational Complexity · Computer Science
Approximating Max-Cut under Graph-MSO Constraints
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2018-10-19
Combinatorics · Mathematics
Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2024-09-13
Combinatorics · Mathematics
Sharp upper bounds on the $k$-independence number in graphs with given minimum and maximum degree
Zhenyu Taoqiu, Suil O, Yongtang Shi
2020-09-01
Discrete Mathematics · Computer Science
Directed graphs and its Boundary Vertices
Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shallet T. J, Ram Kumar
2016-09-13
Combinatorics · Mathematics
Disjoint cycles of different lengths in graphs and digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le, Binlong Li +1
2016-01-11
Combinatorics · Mathematics
On networks with order close to the Moore bound
James Tuite, Grahame Erskine
2021-08-13
R2 v1 2026-06-21T09:47:08.705Z