Related papers: Burnside Condition on Some Intersection Subgroups
Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we…
We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: (1) intersection graphs of grounded segments and intersection…
This paper summarises the results of our research on macroscopic entanglement in spin systems and free Bosonic gases. We explain how entanglement can be observed using entanglement witnesses which are themselves constructed within the…
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation…
We give several sufficient conditions for a double of a free group along a cyclic subgroup to contain a surface subgroup.
It is proved that the free $m$-generated Burnside groups $\Bbb{B}(m,n)$ of exponent $n$ are infinite provided that $m>1$, $n\ge2^{48}$.
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…
Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…
We establish the phase diagram of the disordered three-dimensional Bose-Hubbard model at unity filling, which has been controversial for many years. The theorem of inclusions, proven in Ref. [1], states that the Bose glass phase always…
A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are…
We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
A group $G$ splits over a subgroup $C$ if $G$ is either a free product with amalgamation $A \underset{C}{\ast} B$ or an HNN-extension $G=A \underset{C}{\ast} (t)$. We invoke Bass-Serre theory and classify all infinite groups which admit…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
In their famous 1974 paper introducing the local lemma, Erd\H{o}s and Lov\'asz posed a question-later referred by Erd\H{o}s as one of his three favorite open problems: What is the minimum number of edges in an $r$-uniform, intersecting…
We prove a version of the BKK theorem for the ring of conditions of a spherical homogeneous space $G/H$. We also introduce the notion of ring of complete intersections, firstly for a spherical homogeneous space and secondly for an arbitrary…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…