相关论文: Degree versions of the Erdos-Ko-Rado Theorem and E…

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…

In 1965 Erd\H{o}s conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative…

Let $M_k$ be a $2n$-vertex graph with $n$ pairwise disjoint edges and let $\mathcal{H}^{(p,s)}(n)$ be the family of subsets of $V(M_n)$ that span exactly $p$ edges and $s$ isolated vertices. We prove that for $n\ge 2p+s$ this family has the…

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

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…

The Erd\H{o}s-S\'{o}s Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that Erd\H{o}s-S\'{o}s Conjecture is true for…

The famous Erd\H{o}s-S\'os conjecture states that every graph of average degree more than $t-1$ must contain every tree on $t+1$ vertices. In this paper, we study a spectral version of this conjecture. For $n>k$, let $S_{n,k}$ be the join…

A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of…

We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \ge d_2 \ge \dots \ge d_n$ be the vertex…

The matching number of a family of subsets of an $n$-element set is the maximum number of pairwise disjoint sets. The families with matching number $1$ are called intersecting. The famous Erd\H os-Ko-Rado theorem determines the size of the…

A family of subsets $\mathcal{F}$ is intersecting if $A \cap B \neq \emptyset$ for any $A, B \in \mathcal{F}$. In this paper, we show that for given integers $k > d \ge 2$ and $n \ge 2k+2d-3$, and any intersecting family $\mathcal{F}$ of…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

A well-known conjecture of Erd\H{o}s and S\'os states that every graph with average degree exceeding $m-1$ contains every tree with $m$ edges as a subgraph. We propose a variant of this conjecture, which states that every graph of maximum…

The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…

For a hypergraph $\mathcal{H}$, define the minimum positive codegree $\delta_i^+(\mathcal{H})$ to be the largest integer $k$ such that every $i$-set which is contained in at least one edge of $\mathcal{H}$ is contained in at least $k$…

Let $\mathcal{H} \subseteq \binom{[n]}{r}$ be an $r$-uniform hypergraph on vertex set $[n] = \{1,2,\dots, n\}$. For an $r$-set of vertices $S \subseteq [n]$, the \emph{degree} of $S$ is defined as $\textrm{deg}(S)=\sum_{v \in…

We conjecture that every $n$-vertex graph of minimum degree at least $\frac k2$ and maximum degree at least $2k$ contains all trees with $k$ edges as subgraphs. We prove an approximate version of this conjecture for trees of bounded degree…

Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$. If $H$ contains no isolated vertex and $deg(u)+ deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$…