Related papers: Burnside Condition on Some Intersection Subgroups
Scott conjectured that the class of graphs with no induced subdivision of a given graph is $\chi$-bounded. We verify his conjecture for maximal triangle-free graphs.
In this paper, we prove that the maximal order of a semiregular element in the automorphism group of a cubic vertex-transitive graph X does not tend to infinity as the number of vertices of X tends to infinity. This gives a solution (in the…
We show that in the free group of rank 3, given an arbitrary number of automorphisms, the intersection of their fixed subgroups is equal to the fixed subgroup of some other single automorphism.
Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\KG{r}{\pmb s}{\calS}$, "generalized $r$-uniform Kneser hypergraphs with intersection multiplicities $\pmb s$." It generalized previous…
We explore the concept of conjugation between subgroupoids, providing several characterizations of the conjugacy relation (Theorem A in {\S}1.2). We show that two finite groupoid-sets, over a locally strongly finite groupoid, are…
We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…
A random graph of free groups contains a surface subgroup
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f. An incidence p-colouring…
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, the so called $B_0$-VPG graphs. Recognizing this class is an NP-complete problem. Although, there exists a polynomial time…
A Magnus subgroup of a one-relator group is the free subgroup freely generated by a proper subset of the generators. Two such subgroups can intersect in the obvious way or in a larger, exceptional way. The condition of non-exceptional…
We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
String graphs, that is, intersection graphs of curves in the plane, have been studied since the 1960s. We provide an expository presentation of several results, including very recent ones: some string graphs require an exponential number of…
We present an alternative approach to unveil a different kind of entanglement in bipartite quantum states whose diagonal zero patterns in suitable matrix representations admit a nice description in terms of triangle-free graphs. Upon…
In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied…
This article is a first step in the study of equations in periodic groups. As an application, we study the structure of periodic quotients of hyperbolic groups. We investigate for instance the Hopf and co-Hopf properties, the isomorphism…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |,…
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given…