Related papers: Amalgamation and Keisler's Order

Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…

For $0\leq \ell <k$, a Hamiltonian $\ell$-cycle in a $k$-uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every two consecutive edges overlap in exactly $\ell$ vertices. We…

The classical K\H{o}v\'ari-S\'os-Tur\'an theorem states that if $G$ is an $n$-vertex graph with no copy of $K_{s,t}$ as a subgraph, then the number of edges in $G$ is at most $O(n^{2-1/s})$. We prove that if one forbids $K_{s,t}$ as an…

We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…

Estimating the probability that the Erd\H{o}s-R\'enyi random graph $G(n,m)$ is $H$-free, for a fixed graph $H$, is one of the fundamental problems in random graph theory. If $m$ is such that each edge of $G(n,m)$ belongs to a copy of $H'$…

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]$…

Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by $f(n,k)$: the maximal number of Hamiltonian cycles on an $n$ element set, such that no…

A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…

Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs with $n$ vertices and maximum degree at most $r$, where $n =…

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Let $G$ be a triangle-free graph with $n$ vertices and average degree $t$. We show that $G$ contains at least \[ e^{(1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t (\frac{1}{2}\ln t-1)} \] independent sets. This improves a recent result of the…

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

For $1\le \ell<k/2$, we show that for sufficiently large $n$, every $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\frac n{2 (k-\ell)} $ contains a Hamilton $\ell$-cycle. This codegree condition is best possible and…

Kneser's 1955 conjecture -- proven by Lov\'asz in 1978 -- asserts that in any partition of the $k$-subsets of $\{1, 2, \dots, n\}$ into $n-2k-3$ parts, one part contains two disjoint sets. Schrijver showed that one can restrict to…

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…

In this short note, we provide a new infinite family of $K_{2, t+1}$-free graphs for each prime power $t$. Using these graphs, we show that it is possible to partition the edges of $K_n$ into parts, such that each part is isomorphic to our…

Let $G$ be a simple graph with $n$ vertices and $m$ edges. According to Tur\'{a}n's theorem, if $G$ is $K_{r+1}$-free, then $m \leq |E(T(n, r))|,$ where $T(n, r)$ denotes the Tur\'{a}n graph on $n$ vertices with a maximum clique of order…

Let K be an Abstract Elemenetary Class satisfying the amalgamation and the joint embedding property, let \mu be the Hanf number of K. Suppose K is tame. MAIN COROLLARY: (ZFC) If K is categorical in a successor cardinal bigger than…

Using an infinitary version of the Hypergraph Removal Lemma due to Towsner, we prove a model-theoretic higher amalgamation result. In particular, we obtain an independent amalgamation property which holds in structures which are measurable…