Related papers: Realizability of hypergraphs and intrinsic link th…
We prove a descriptive theorem on the extrinsic geometry of an embedded minimal surface of injectivity radius zero in a homogeneously regular Riemannian three-manifold, in a certain small intrinsic neighborhood of a point of almost-minimal…
A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…
In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that every large $n$-vertex graph with minimum degree at least $(1/2 + \gamma)n$ contains all spanning trees of bounded degree. We consider a generalization of this result to loose…
In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…
Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…
An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…
This paper develops a symplectic bifurcation theory for integrable systems in dimension four. We prove that if an integrable system has no hyperbolic singularities and its bifurcation diagram has no vertical tangencies, then the fibers of…
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem…
We say that a graph $F$ can be embedded into a graph $G$ if $G$ contains an isomorphic copy of $F$ as a subgraph. Guo and Volkmann \cite{GV} conjectured that if $G$ is a connected graph with at least $n$ vertices and minimum degree at least…
The subject of this work is a three-dimensional topological field theory with a non-semisimple group of gauge symmetry with observables consisting in the holonomies of connections around three closed loops. The connections are a linear…
This is a revision of some expository lecture notes written originally for a 5-hour minicourse on the intersection theory of punctured holomorphic curves and its applications in 3-dimensional contact topology. The main lectures are aimed…
Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform…
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting: given a graph $G$ and a set $\mathcal{F}$ of forbidden graphs, the goal is to compute a minimum-sized set $S$ of vertices of $G$ such that $G-S$ does…
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. The conjecture has been proved under some - rather strong - \emph{structural}…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…
In this paper, we show that a uniform hypergraph $\mathcal{G}$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of…
There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this…
In this paper, we study confoliations in dimensions higher than three mostly from the perspective of symplectic fillability. Our main result is that Massot-Niederkr\"uger-Wendl's bordered Legendrian open book, an object that obstructs the…