Related papers: The strong slope conjecture for cablings and conne…
A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…
We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…
In the paper, we give rigidity theorems when the glued space of two Alexandrov spapces with curvature bounded below is a suspension, cone or join. And we list some basic properties of joins in Appendix.
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and…
In this paper, we introduce the notion of strong geometry, a structure composed by both the chirotope of a set of points X in the d-dimensional space and the wedge chirotope which is the specific adjoint chirotope induced by the hyperplanes…
In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…
We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of…
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
Edmonds, Lov\'asz, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjecture: if a matching covered graph has a nontrivial tight cut…
We prove a scalar curvature rigidity theorem for convex polytopes. The proof uses the Fredholm theory for Dirac operators on manifolds with boundary. A variant of a theorem of Fefferman and Phong plays a central role in our analysis.
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
Let ${\mathcal G}$ be an infinite family of connected graphs and let $k$ be a positive integer. We say that $k$ is ${\it forcing}$ for ${\mathcal G}$ if for all $G \in {\mathcal G}$ but finitely many, the following holds. Any…
The strong thin tree conjecture states that every $k$-edge-connected graph $G$ contains an $O(1/k)$-thin spanning tree, meaning a spanning tree which contains at most an $O(1/k)$ fraction of the edges across each cut in $G$. This conjecture…
A connect sum formula for the two variable series invariant of a complement of knot is proposed. We provide two kinds of numerical evidence for the proposed formula by examining various torus knots.
Let S(D) be the surface produced by applying Seifert's algorithm to the oriented link diagram D. I prove that if D has no negative crossings then S(D) is a quasipositive Seifert surface, that is, S(D) embeds incompressibly on a fiber…
Let $\Lambda(T)$ denote the set of leaves in a tree $T$. One natural problem is to look for a spanning tree $T$ of a given graph $G$ such that $\Lambda(T)$ is as large as possible. This problem is called maximum leaf number, and it is a…
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations…