Related papers: Minimum degree in simplicial complexes

For a $k$-uniform hypergraph $H$, let $\delta_1(H)$ denote the minimum vertex degree of $H$, and $\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\geq 3$ and $\beta>0$, there exists an integer…

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

A vertex of degree one is called an end-vertex, and an end-vertex of a tree is called a leaf. A tree with at most $k$ leaves is called a $k$-ended tree. For a positive integer $k$, let $t_k$ be the order of a largest $k$-ended tree. Let…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

We show that for each abelian number field $K$ of sufficiently large degree $d$ there exists an element $\alpha\in K$ with $K=\IQ(\alpha)$ and absolute Weil height $H(\alpha)\ll_d |\Delta_K|^{1/2d}$ , where $\Delta_K$ denotes the…

Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$-vertex graph $G$ with minimum degree at least $\frac{1}{2k-1}n$ and without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we prove a…

We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\'asfai, Erd\H os, and S\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum…

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set. The proof handles the simple cases via…

We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at…

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

The $d$-process generates a graph at random by starting with an empty graph with $n$ vertices, then adding edges one at a time uniformly at random among all pairs of vertices which have degrees at most $d-1$ and are not mutually joined. We…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

Recently, Ma, Qian and Shi determined the maximum size of an $n$-vertex graph with given fractional matching number $s$ and maximum degree at most $d$. Motivated by this result, we determine the maximum number of $\ell$-cliques in a graph…

The degree of a based graph is the number of essential nonbasepoint vertices after generic perturbation. Hatcher--Vogtmann's degree theorem states that the subcomplex of Auter space of graphs of degree at most d is (d-1)-connected. We…