相关论文: Compression and Erdos-Ko-Rado graphs

Let $c\in (0, 1]$ be a real number and let $n$ be a sufficiently large integer. We prove that every $n$-vertex $c n$-regular graph $G$ contains a collection of $\lfloor 1/c \rfloor$ paths whose union covers all but at most $o(n)$ vertices…

An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…

Let $G$ be a simple graph with vertex set $V(G)$. A set $S\subseteq V(G)$ is independent if no two vertices from $S$ are adjacent. For $X\subseteq V(G)$, the difference of $X$ is $d(X) = |X|-|N(X)|$ and an independent set $A$ is critical if…

A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an…

Let $K_{r_1,\ldots,r_s}$ denote the complete multipartite graph with class sizes $r_1,\ldots,r_s$ and let $K_s$ denote the complete graph of order $s$. In 2018, Luo determined the maximum number of $K_s$ in 2-connected graphs with a given…

Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all…

We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\'edi theorem characterises the minimum degree that ensures a graph…

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…

The celebrated Erd\H{o}s-Ko-Rado (EKR) theorem for Paley graphs (of square order) states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended…

A K\H{o}nig--Egerv\'ary graph is a graph $G$ satisfying $\alpha(G)+\mu(G)=n(G)$, where $\alpha(G)$, $\mu(G)$, and $n(G)$ denote the independence number, the matching number, and the order of $G$, respectively. Let $\textnormal{core}(G)$ and…

A $2k$-matching is a perfect matching of the complete graph on $2k$ vertices. Two $2k$-matchings are defined to be $t$-intersecting if they have at least $t$ edges in common. The main result in this paper is that if $k \geq 3t/2+1$, then…

A well-known result of Chv\'{a}tal and Erd\H{o}s from 1972 states that a graph with connectivity not less than its independence number plus one is hamiltonian-connected. A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$…

The following question was proposed by Nenadov and Pehova and reiterated by Knierim and Su: Given integers $\ell,r$ and $n$ with $n\in r\mathbb{N}$, is it true that every $n$-vertex graph $G$ with $\delta(G) \ge \max \{ \frac{1}{2},\frac{r…

A set $S$ of isometric paths of a graph $G$ is ``$v$-rooted'', where $v$ is a vertex of $G$, if $v$ is one of the endpoints of all the isometric paths in $S$. The isometric path complexity of a graph $G$, denoted by $ipco{G}$, is the…

Let $A$ and $B$ be sets of vertices in a graph $G$. Menger's theorem states that for every positive integer $k$, either there exists a collection of $k$ vertex-disjoint paths between $A$ and $B$, or $A$ can be separated from $B$ by a set of…

Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\subset{V}$. If the graph $G-U$ has no subgraph isomorphic to $H$, $U$ is a cover…

Let $G$ be a finite connected graph, and let $\rho$ be the spectral radius of its universal cover. For example, if $G$ is $k$-regular then $\rho=2\sqrt{k-1}$. We show that for every $r$, there is an $r$-covering (a.k.a. an $r$-lift) of $G$…

Given a graph $G$, the number of its vertices is represented by $n(G)$, while the number of its edges is denoted as $m(G)$. An independent set in a graph is a set of vertices where no two vertices are adjacent to each other and the size of…

A set is called r-independent, if every two vertices of it are in distance greater then r. In the r-independent set problem with parameter k, we ask whether in a given graph G there exists an r-independent set of size k. In this work we…