English
Related papers

Related papers: Canonical Ramsey numbers for partite hypergraphs

200 papers

We consider linear partial differential equations on resistance spaces that are uniformly elliptic and parabolic in the sense of quadratic forms and involve abstract gradient and divergence terms. Our main interest is to provide graph and…

Functional Analysis · Mathematics 2020-09-15 Michael Hinz , Melissa Meinert

We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.

Combinatorics · Mathematics 2019-05-17 R. M. Causey , C. Doebele

We prove the following: Fix an integer $k\geq 2$, and let $T$ be a real number with $T\geq 1.5$. Let $\cH=(V,\cE_2\cup \cE_3\cup\dots\cup\cE_k)$ be a non-uniform hypergraph with the vertex set $V$ and the set $\cE_i$ of edges of size…

Combinatorics · Mathematics 2016-02-12 Sang June Lee , Hanno Lefmann

Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over…

Combinatorics · Mathematics 2013-03-21 Jan Goedgebeur , Stanisław P. Radziszowski

A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed…

Combinatorics · Mathematics 2017-09-08 Bhargav Narayanan , Julian Sahasrabudhe , István Tomon

For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…

Combinatorics · Mathematics 2017-05-17 Dhruv Mubayi , Vojtech Rodl

This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…

Combinatorics · Mathematics 2025-08-05 C. Terry

A graph is $d$-degenerate if all its subgraphs have a vertex of degree at most $d$. We prove that there exists a constant $c$ such that for all natural numbers $d$ and $r$, every $d$-degenerate graph $H$ of chromatic number $r$ with $|V(H)|…

Combinatorics · Mathematics 2016-12-02 Choongbum Lee

For two metric spaces $\mathbb X$ and $\mathcal Y$, the chromatic number $\chi(\mathbb X;\mathcal Y)$ of $\mathbb X$ with forbidden $\mathcal Y$ is the smallest $k$ such that there is a coloring of the points of $\mathbb X$ with $k$ colors…

Combinatorics · Mathematics 2023-06-22 Andrey Kupavskii , Arsenii Sagdeev

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…

Combinatorics · Mathematics 2024-11-26 Vladislav Taranchuk

An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…

Combinatorics · Mathematics 2016-05-06 Joel Moreira

The paper investigates uniform convergence of wavelet expansions of Gaussian random processes. The convergence is obtained under simple general conditions on processes and wavelets which can be easily verified. Applications of the developed…

Probability · Mathematics 2013-07-29 Yuriy Kozachenko , Andriy Olenko , Olga Polosmak

Let $K\_{[k,t]}$ be the complete graph on $k$ vertices from which a set of edges, induced by a clique of order $t$, has been dropped. In this note we give two explicit upper bounds for $R(K\_{[k\_1,t\_1]},\dots, K\_{[k\_r,t\_r]})$ (the…

Combinatorics · Mathematics 2014-12-15 Jonathan Chappelon , Luis Pedro Montejano , Jorge Luis Ramírez Alfonsín

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…

We present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…

Probability · Mathematics 2024-10-01 Yuri Yakubovich

Let n \geq l \geq 2 and q \geq 2. We consider the minimum N such that whenever we have N points in the plane in general position and the l-subsets of these points are colored with q colors, there is a subset S of n points all of whose…

Combinatorics · Mathematics 2014-04-08 Dhruv Mubayi , Andrew Suk

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

When does the amount of torsion in the homology of an arithmetic group grow exponentially with the covolume? We give many examples where this is so, and conjecture precise conditions.

Number Theory · Mathematics 2010-04-08 Nicolas Bergeron , Akshay Venkatesh

An open question asks whether every group acting acylindrically on a hyperbolic space has uniform exponential growth. We prove that the class of groups of uniform uniform exponential growth acting acylindrically on a hyperbolic space is…

Group Theory · Mathematics 2026-04-22 Xabier Legaspi , Markus Steenbock

We find the asymptotic value of the Ramsey number for a triple of long cycles, where the lengths of the cycles are large but may have different parity.

Combinatorics · Mathematics 2019-03-12 Agnieszka Figaj , Tomasz Luczak