Related papers: Spanning surfaces in 3-graphs

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…

It is well known that a compact two dimensional surface is homeomorphic to a polygon with the edges identified in pairs. This paper not only presents a new proof of this statement but also generalizes it for any connected n-dimensional…

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

Building on Whitney's classical method of triangulating smooth manifolds, we show that every compact $d$-dimensional smooth manifold admits a triangulation with dual graph of twin-width at most $d^{O(d)}$. In particular, it follows that…

We show that any noncompact oriented surface is homeomorphic to the leaf of a minimal foliation of a closed $3$-manifold. These foliations are (or are covered by) suspensions of continuous minimal actions of surface groups on the circle.…

We prove that the maximum number of edges in a 3-uniform linear hypergraph on $n$ vertices containing no 2-regular subhypergraph is $n^{1+o(1)}$. This resolves a conjecture of Dellamonica, Haxell, Luczak, Mubayi, Nagle, Person, R\"odl,…

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

For a compact oriented smooth $n$-manifold $M$ and a codimension-$1$ homology class $\phi \in \operatorname{H}_{n-1}(M, \partial M)$, we investigate a simplicial complex $\mathcal{S}^\dagger(M, \phi)$ relating the properly embedded…

We show that in any triangulated 3-manifold, every index n topologically minimal surface can be transformed to a surface which has local indices (as computed in each tetrahedron) that sum to at most n. This generalizes classical theorems of…

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\geq 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch…

We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any $d$-regular graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each…

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

Erd\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\lfloor n/2 \rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least…

Generalizing well-known results of Erd\H{o}s and Lov\'asz, we show that every graph $G$ contains a spanning $k$-partite subgraph $H$ with $\lambda{}(H)\geq \lceil{}\frac{k-1}{k}\lambda{}(G)\rceil$, where $\lambda{}(G)$ is the…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…