Related papers: Suslin tree preservation and club isomorphisms
Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…
We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.
Bass and Kulkarni proved that any pair of free uniform lattices in the automorphism group of a tree have conjugates that both lie inside a third uniform lattice (which is not necessarily free). We show that this does not generalise to trees…
We explicitly construct several Poisson structures with compact support. For example, we show that any Poisson structure on $\R^n$ with polynomial coefficients of degree at most two can be modified outside an open ball, such that it becomes…
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…
Martin Klazar computed the total weight of ordered trees under 12 different notions of weight. The last and perhaps most interesting of these weights, w_{12}, led to a recurrence relation and an identity for which he requested combinatorial…
In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy…
Two-dimensional version of the classical Mycielski theorem says that for every comeager or conull set $X\subseteq [0,1]^2$ there exists a perfect set $P\subseteq [0,1]$ such that $P\times P\subseteq X\cup \Delta$. We consider…
We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…
We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special case, we show that unrooted spanning forests, which arise as a q…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
In this project, we develop a new connection between the dynamics of quadratic polynomials on the complex plane and the dynamics of homeomorphisms of surfaces. In particular, given a quadratic polynomial, we investigate whether one can…
We prove that there exists a constant $c>0$ such that for all integers $2\leq t\leq cn$, if $\calA$ is a collection of spanning trees in $K_n$ such that any two intersect at at least $t$ edges, then $|\calA|\leq 2^tn^{n-t-2}$. This bound is…
Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…
The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…
We give an example of a subgroup of SL(2,C) which is a strictly ascending HNN extension of a non-abelian finitely generated free group F. In particular, we exhibit a free group F in SL(2,C) of rank 6 which is conjugate to a proper subgroup…