Related papers: Embedding perfectly balanced 2-caterpillar into it…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
The conjecture of Beineke and Harary states that for any two vertices which can be separated by $k$ vertices and $l$ edges for $l\geq 1$ but neither by $k$ vertices and $l-1$ edges nor $k-1$ vertices and $l$ edges there are $k+l$…
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…
We prove that, for every natural number $k$, every sufficiently large 3-connected cubic planar graph has a cycle whose length is in $[k,2k+9]$. We also show that this bound is close to being optimal by constructing, for every even $k\geq…
A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…
Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices,…
The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hamiltonian cycle in $BH_n$ with each vertex incident to at…
A covering path for a planar point set is a path drawn in the plane with straight-line edges such that every point lies at a vertex or on an edge of the path. A covering tree is defined analogously. Let $\pi(n)$ be the minimum number such…
J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T'] where T and T' are balanced binary trees are isomorphic as posets to a hypercube. We introduce synchronous…
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a…
We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…
A tanglegram $\cal T$ consists of two rooted binary trees with the same number of leaves, and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn with the leaves on two parallel lines, the trees on either…
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs…
Extending some properties from the Euclidean plane to any normed plane, we show the validity of the Monma-Paterson-Suri-Yao algorithm for finding the maximum-weighted spanning tree of a set of $n$ points, where the weight of an edge is the…
Inspired by the seminal works of Khuller et al. (STOC 1994) and Chan (SoCG 2003) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck spanning tree is a spanning tree whose largest edge-length…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…
The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…
We show that for every $\eta>0$ every sufficiently large $n$-vertex oriented graph D of minimum semidegree exceeding $(1 + \eta) k/2$ contains every balanced antidirected tree with $k$ edges and bounded maximum degree, if $k \ge \eta n$. In…