AbstractIn the context of two-path convexity, we study the rank, Helly number, Radon number, Caratheodory number, and hull number for multipartite tournaments. We show the maximum Caratheodory number of a multipartite tournament is 3. We then derive tight upper bounds for rank in both general multipartite tournaments and clone-free multipartite tournaments. We show that these same tight upper bounds hold for the Helly number, Radon number, and hull number. We classify all clone-free multipartite tournaments of maximum Helly number, Radon number, hull number, and rank
Given a polytope $P \subseteq \mathbb{R}^n$, the Chv\'atal-Gomory procedure computes iteratively the...
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles ...
Let D-n(r) denote the convex hull of degree sequences of simple r-uniform hypergraphs on the vertex ...
AbstractIn the context of two-path convexity, we study the rank, Helly number, Radon number, Carathe...
We present some results on two-path convexity in clone-free regular multipartite tournaments. After ...
We investigate the convex invariants associated with two-path convexity in clone-free multipartite t...
We study two-path convexity in bipartite tournaments. For a bipartite tour-nament, we obtain both a ...
The collection of convex subsets of a multipartite tournament T forms a lattice C(T). Given a lattic...
The Carathéodory, Helly, and Radon numbers are three main invariants in convexity theory. They relat...
The Carathéodory, Helly, and Radon numbers are three main invariants in convexity theory. These inva...
AbstractA set K of vertices in a connected graph is M-convex if and only if for every pair of vertic...
We consider the P3-convexity on simple undirected graphs, in which a set of vertices S is convex if ...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractA family P of simple (that is, cycle-free) paths is a path decomposition of a tournament T i...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Given a polytope $P \subseteq \mathbb{R}^n$, the Chv\'atal-Gomory procedure computes iteratively the...
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles ...
Let D-n(r) denote the convex hull of degree sequences of simple r-uniform hypergraphs on the vertex ...
AbstractIn the context of two-path convexity, we study the rank, Helly number, Radon number, Carathe...
We present some results on two-path convexity in clone-free regular multipartite tournaments. After ...
We investigate the convex invariants associated with two-path convexity in clone-free multipartite t...
We study two-path convexity in bipartite tournaments. For a bipartite tour-nament, we obtain both a ...
The collection of convex subsets of a multipartite tournament T forms a lattice C(T). Given a lattic...
The Carathéodory, Helly, and Radon numbers are three main invariants in convexity theory. They relat...
The Carathéodory, Helly, and Radon numbers are three main invariants in convexity theory. These inva...
AbstractA set K of vertices in a connected graph is M-convex if and only if for every pair of vertic...
We consider the P3-convexity on simple undirected graphs, in which a set of vertices S is convex if ...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractA family P of simple (that is, cycle-free) paths is a path decomposition of a tournament T i...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Given a polytope $P \subseteq \mathbb{R}^n$, the Chv\'atal-Gomory procedure computes iteratively the...
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles ...
Let D-n(r) denote the convex hull of degree sequences of simple r-uniform hypergraphs on the vertex ...