Related papers: Amalgamation and Keisler's Order

Motivated by recent work on majority edge-colourings of graphs, we initiate the study of the corresponding problem for hypergraphs. First, sharpening the probabilistic argument by a $KL$ large-deviation estimate, we obtain a sufficient…

We consider the following generalized Tur\'an problem: For $2 \le s \le t$, what is the maximum number of triangles in a $K_{1,s,t}$-free graph on $n$ vertices? The previously best known lower and upper bounds are $\Omega(n^2)$ and…

In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…

It is shown that there exists a compact planar set K such that the uniform algebra R(K) is nontrivial and strongly regular. This settles an issue raised by Donald Wilken 55 years ago. It is shown that the set K can be chosen such that, in…

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

An edge colouring of $K_n$ with $k$ colours is a Gallai $k$-colouring if it does not contain any rainbow triangle. Gy\'arf\'as, P\'alv\"olgyi, Patk\'os and Wales proved that there exists a number $g(k)$ such that $n\geq g(k)$ if and only if…

Let G be a group, Fin the family of its finite subgroups, and E(G,Fin) the classifying space. Let L^1 be the algebra of trace-class operators in an infinite dimensional, separable Hilbert space over the complex numbers. Consider the…

A result of Gy\'arf\'as says that for every $3$-coloring of the edges of the complete graph $K_n$, there is a monochromatic component of order at least $\frac{n}{2}$, and this is best possible when $4$ divides $n$. Furthermore, for all…

Turan's Theorem states that every graph of a certain edge density contains a complete graph $K^k$ and describes the unique extremal graphs. We give a similar Theorem for l-partite graphs. For large l, we find the minimal edge density…

In this paper, we consider the group Aut$(\mathbb{Q}, \leq)$ of order-automorphisms of the rational numbers, proving a result analogous to a theorem of Galvin's for the symmetric group. In an announcement, Kh\'elif states that every…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

Gyarfas conjectured in 1985 that for all $k$, $l$, every graph with no clique of size more than $k$ and no odd hole of length more than $l$ has chromatic number bounded by a function of $k$ and $l$. We prove three weaker statements: (1)…

We study the maximum number of hyperedges in a 3-uniform hypergraph on $n$ vertices that does not contain a Berge cycle of a given length $\ell$. In particular we prove that the upper bound for $C_{2k+1}$-free hypergraphs is of the order…

Let a torus $T$ act on a symplectic manifold $(M,\omega)$ with moment map $\phi$. We say that the Hamiltonian $T$-manifold $(M,\omega,\phi)$ has complexity one if $\frac{1}{2} \dim M - \dim T = 1$, and that it is K\"ahler if it admits an…

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

All hyperK\"ahler ALE 4-manifolds with a given non-trivial finite group $\Gamma$ in $SU(2)$ at infinity are parameterized by an open dense subset of a real linear space of dimension $3$rank$\Phi$. Here, $\Phi$ denotes the root system…