Related papers: The Erd\H{o}s-Ko-Rado property for some permutatio…

For natural numbers $n,r \in \mathbb{N}$ with $n\ge r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\dots,n\}$ in which two sets are adjacent if and only if they are disjoint. Delete the edges of…

We say that a family of $k$-subsets of an $n$-element set is intersecting if any two of its sets intersect. In this paper we study properties and structure of large intersecting families. We prove a conclusive version of Frankl's theorem on…

A family of permutations $\mathcal{F} \subseteq S_n$ is even-cycle-intersecting if $\sigma \pi^{-1}$ has an even cycle for all $\sigma,\pi \in \mathcal{F}$. We show that if $\mathcal{F} \subseteq S_n$ is an even-cycle-intersecting family of…

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Two families of sets $\mathcal{A}$ and $\mathcal{B}$ are called cross-$t$-intersecting if $|A\cap B|\ge t$ for all $A\in \mathcal{A}$, $B\in \mathcal{B}$. An active problem in extremal set theory is to determine the maximum product of sizes…

We show that the the shift on the reduced C*--algebras of RD--groups, including the free group on infinitely many generators, and the amalgamated free product C*--algebras, enjoys the very strong ergodic property of the convergence to the…

Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n,k) is the graph with vertex set $\binom{[n]}{k}$, such that two vertices are adjacent if they are disjoint. We…

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. An intersecting family is said to be \emph{trivial} it its sets have a common element. A graph $G$ is said to be $r$-EKR if at least one…

For an integer $r \ge 3$ and a subset $L \subset [0,r-1]$, a graph $G$ is $(K_{r}, L)$-intersecting if the number of vertices in the intersection of every pair of $K_r$ in $G$ belongs to $L$. We study the maximum number of $K_r$ in an…

We shall be interested in the following Erdos-Ko-Rado-type question. Fix some subset B of [n]. How large a family A of subsets of [n] can we find such that the intersection of any two sets in A contains a cyclic translate (modulo n) of B?…

Given a finite transitive group $G\leq \operatorname{Sym}(\Omega)$, a subset $\mathcal{F}$ of $G$ is \emph{intersecting} if any two elements of $\mathcal{F}$ agree on some element of $\Omega$. The \emph{intersection density} of $G$, denoted…

Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…

A family of permutations A \subset S_n is said to be intersecting if any two permutations in A agree at some point, i.e. for any \sigma, \pi \in A, there is some i such that \sigma(i)=\pi(i). Deza and Frankl showed that for such a family,…

Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

A subset $\mathcal{F}$ of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is intersecting if for any $g,h\in \mathcal{F}$ there exists $\omega \in \Omega$ such that $\omega^g = \omega^h$. The \emph{intersection density}…

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

If $E$ is a directed graph and $K$ is a field, the Leavitt path algebra $L_K(E)$ of $E$ over $K$ is naturally graded by the group of integers $\mathbb Z.$ We formulate properties of the graph $E$ which are equivalent with $L_K(E)$ being a…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…