Related papers: $\leq_{SP}$ Can Have Infinitely Many Classes

We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous countable structures. We first consider the existence of dense conjugacy classes (the topological Rokhlin property).…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…

We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex…

Let $G$ be a finitely generated abelian-by-finite group and $k$ a field of characteristic $p\ge 0$. The Euler class $[k_G]$ of $G$ over $k$ is the class of the trivial $kG$-module in the Grothendieck group $G_0(kG)$. We show that $[k_G]$…

The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…

If $K$ is a field with involution and $E$ an arbitrary graph, the involution from $K$ naturally induces an involution of the Leavitt path algebra $L_K(E).$ We show that the involution on $L_K(E)$ is proper if the involution on $K$ is…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Let $\mathcal{C}$ be a class of graphs closed under taking induced subgraphs. We say that $\mathcal{C}$ has the {\em clique-stable set separation property} if there exists $c \in \mathbb{N}$ such that for every graph $G \in \mathcal{C}$…

We prove that for $k+1\geq 3$ and $c>(k+1)/2$ w.h.p. the random graph on $n$ vertices, $cn$ edges and minimum degree $k+1$ contains a (near) perfect $k$-matching. As an immediate consequence we get that w.h.p. the $(k+1)$-core of $G_{n,p}$,…

We use axioms of abstract ternary relations to define the notion of a free amalgamation theory. These form a subclass of first-order theories, without the strict order property, encompassing many prominent examples of countable structures…

Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be…

Let $G$ be an infinite, connected, locally finite planar graph and consider i.i.d.\ Bernoulli$(p)$ site percolation. Write $p_c^{\mathrm{site}}(G)$ and $p_u^{\mathrm{site}}(G)$ for the critical and uniqueness thresholds. Using a…

The Skolem-Mahler-Lech theorem states that if $f(n)$ is a sequence given by a linear recurrence over a field of characteristic 0,then the set of $m$ such that $f(m)$ is equal to 0 is the union of a finite number of arithmetic progressions…

We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…

Garret Birkhoff's HSP theorem characterizes the classes of models of algebraic theories as those being closed with respect to homomorphic images, subalgebras, and products. In particular, it implies that an algebra $\mathbf{B}$ satisfies…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…