相关论文: Maximal co-cliques in the Kneser graph on plane-so…

We determine the asymptotics of the independence number of the random $d$-regular graph for all $d \ge d_0$. It is highly concentrated, with constant-order fluctuations around $n\alpha_* - c_*\log n$ for explicit constants $\alpha_*(d)$ and…

Given a graph $G$ and a constant $\gamma \in [0,1]$, let $\omega^{(\gamma)}(G)$ be the largest integer $r$ such that there exists an $r$-vertex subgraph of $G$ containing at least $\gamma \binom{r}{2}$ edges. It was recently shown that…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

We present a new lower bound on the spectral gap of the Glauber dynamics for the Gibbs distribution of a spectrally independent $q$-spin system on a graph $G = (V,E)$ with maximum degree $\Delta$. Notably, for several interesting examples,…

Given a graph $G$, the strong clique number of $G$, denoted $\omega_S(G)$, is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the line graph of $G$. As a relaxation of the renowned…

In this paper, we study cliques and chromatic number of inhomogenous random graphs where the individual edge probabilities could be arbitrarily low. We use a recursive method to obtain estimates on the maximum clique size under a mild…

Let $D=(\mathcal{P},\mathcal{B})$ be a symmetric $(v,k,\lambda)$-design and let $(X,Y)$ be an equinumerous incidence-free pair, with $X\subseteq \mathcal{P}$ and $Y\subseteq \mathcal{B}$. In this note, we give an elementary proof which…

We investigate the independence number of two graphs constructed from a polarity of $\mathrm{PG}(2,q)$. For the first graph under consideration, the Erd\H{o}s-R\'enyi graph $ER_q$, we provide an improvement on the known lower bounds on its…

We establish a novel connection between the well-known chromatic threshold problem in extremal combinatorics and the celebrated $(p,q)$-theorem in discrete geometry. In particular, for a graph $G$ with bounded clique number and a natural…

The {\em independence ratio} of a graph $G$ is defined by \[ \iota(G) := \sup_{X \subset V(G)} \frac{|X|}{\alpha(X)},\] where $\alpha(X)$ is the independence number of the subgraph of $G$ induced by $X$. The independence ratio is a…

Let G be a graph. Consider two nonadjacent vertices x and y that have a common neighbor. Folding G with respect to x and y is the operation which identifies x and y. After a maximal series of foldings the graph is a disjoint union of…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…

For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. A construction is given which…

Extremal problems concerning the number of complete subgraphs have a long story in extremal graph theory. Let $k_s(G)$ be the number of $s$-cliques in a graph $G$ and $m={{r_m}\choose s}+t_m$, where $0\le t_m\leq r_m$. Edr\H{o}s showed that…

In this paper, we study the maximum degree in non-empty induced subgraphs of the Kneser graph $KG(n,k)$. One of the main results asserts that, for $k>k_0$ and $n>64k^2$, whenever a non-empty subgraph has $m\ge k{n-2\choose k-2}$ vertices,…

In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The Inverse Domination Conjecture says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with…

A highly influential result of Nikiforov states that if an $n$-vertex graph $G$ contains at least $\gamma n^h$ copies of a fixed $h$-vertex graph $H$, then $G$ contains a blowup of $H$ of order $\Omega_{\gamma,H}(\log n)$. While the…

We consider the following problem posed by Erdos in 1962. Suppose that $G$ is an $n$-vertex graph where the number of $s$-cliques in $G$ is $t$. How small can the independence number of $G$ be? Our main result suggests that for fixed $s$,…

Let $G$ be a graph of order $n$. For a positive integer $p$, $G$ is said to be a $\mathbf{W}_{p}$ graph if $n\geq p$ and every $p$ pairwise disjoint independent sets of $G$ are contained within $p$ pairwise disjoint maximum independent…

The problem of computing the chromatic number of Kneser hypergraphs has been extensively studied over the last 40 years and the fractional version of the chromatic number of Kneser hypergraphs is only solved for particular cases. The…