首页/论文/2004.14076

arXiv 2004.140762020-04math.COmath.NT

An asymmetric random Rado theorem for single equations: the $0$-statement

Robert Hancock, Andrew Treglown

备注：: 20 pages, 4 figures, author accepted version, to appear in Random Structures and Algorithms

英文摘要：

A famous result of Rado characterises those integer matrices $A$ which are partition regular, i.e. for which any finite colouring of the positive integers gives rise to a monochromatic solution to the equation $Ax=0$. Aigner-Horev and Person recently stated a conjecture on the probability threshold for the binomial random set $[n]_p$ having the asymmetric random Rado property: given partition regular matrices $A_1, \dots, A_r$ (for a fixed $r \geq 2$), however one $r$-colours $[n]_p$, there is always a colour $i \in [r]$ such that there is an $i$-coloured solution to $A_i x=0$. This generalises the symmetric case, which was resolved by Rödl and Ruciński, and Friedgut, Rödl and Schacht. Aigner-Horev and Person proved the $1$-statement of their asymmetric conjecture. In this paper, we resolve the $0$-statement in the case where the $A_i x=0$ correspond to single linear equations. Additionally we close a gap in the original proof of the 0-statement of the (symmetric) random Rado theorem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An Asymmetric Random Rado Theorem: 1-statement

A classical result by Rado characterises the so-called partition-regular matrices $A$, i.e.\ those matrices $A$ for which any finite colouring of the positive integers yields a monochromatic solution to the equation $Ax=0$. We study the {\sl asymmetric} random Rado problem for the (binomial) random set $[n]_p$ in which one seeks to determine the threshold for the property that any $r$-colouring, $r \geq 2$, of the random set has a colour $i \in [r]$ admitting a solution for the matrical equation $A_i x = 0$, where $A_1,\ldots,A_r$ are predetermined partition-regular matrices pre-assigned to th…

2019-06-18math.CO

关于 $t$-相交 Erdős-Ko-Rado 定理的一个注记

A remark on the $t$-intersecting Erdős-Ko-Rado theorem

本文指出 Schrijver 与 Wilson 证明 $t$-相交 Erdős-Ko-Rado 定理的两种线性代数方法实际上是等价的。

2025-07-15math.CO

An extension of the Erdős-Ko-Rado theorem to set-wise $2$-intersecting families of perfect matchings

Two perfect matchings $P$ and $Q$ of the complete graph on $2k$ vertices are said to be set-wise $t$-intersecting if there exist edges $P_{1}, \cdots, P_{t}$ in $P$ and $Q_{1}, \cdots, Q_{t}$ in $Q$ such that the union of edges $P_{1}, \cdots, P_{t}$ has the same set of vertices as the union of $Q_{1}, \cdots, Q_{t}$ has. In this paper we prove an extension of the famous Erdős-Ko-Rado (EKR) theorem to set-wise $2$-intersecting families of perfect matching on all values of $k$, and we conjecture similar statement for all $t\geq 2$.

2021-10-05math.CO

The Maker-Breaker Rado game on a random set of integers

Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously unclaimed integers from $X$, and Maker's aim is to obtain a solution to the system $Ax=b$, whereas Breaker's aim is to prevent this. When $X$ is a random subset of $\{1,\dots,n\}$ where each number is included with probability $p$ independently of all others, we determine the threshold probability $p_0$ for when the game is Maker or Breaker's win, for a lar…

2018-11-27math.CO

Symmetric and asymmetric Ramsey properties in random hypergraphs

A celebrated result of Rödl and Ruciński states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\ge 2$ there exist positive constants $c, C$ such that for $p \leq cn^{-1/m_2(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the "0-statement"), while for $p \geq Cn^{-1/m_2(F)}$ it is $1-o(1)$ (the "1-statement"). Here $m_2(F)$ denotes the $2$-density of $F$. On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is det…

2016-10-04math.CO

随机图中的规范着色

Canonical colourings in random graphs

本研究将确定性场景下的Erdős-Rado规范着色定理推广到随机图环境，证明当ℓ≥4时，随机图规范着色性质的阈值与Rödl-Ruciński拉姆齐阈值一致，核心贡献为借助Conlon-Gowers迁移原理完成1-命题证明。

2025-07-30math.CO

更多相关论文收起更多论文

Towards the 0-statement of the Kohayakawa-Kreuter conjecture

In this paper, we study asymmetric Ramsey properties of the random graph $G_{n,p}$. Let $r \in \mathbb{N}$ and $H_1, \ldots, H_r$ be graphs. We write $G_{n,p} \to (H_1, \ldots, H_r)$ to denote the property that whenever we colour the edges of $G_{n,p}$ with colours from the set $[r] := \{1, \ldots, r\}$ there exists $i \in [r]$ and a copy of $H_i$ in $G_{n,p}$ monochromatic in colour $i$. There has been much interest in determining the asymptotic threshold function for this property. Rödl and Ruciński determined the threshold function for the general symmetric case; that is, when $H_1 = \cdots…

2022-08-24math.CO

A Generalization of Schur's Theorem

This paper is an excerpt from the author's 1968 PhD dissertation [Yale University, 1968] in which the (now) well-known result, commonly known as the Folkman-Rado-Sanders theorem, is proved. The proof uses (finite) alternating sums of integers and an 'iterated Ramsey theorem' in a way analogous to the proof of Schur's theorem using differences of integers and Ramsey's theorem for the coloring of the edges of a complete graph. The proof predates all others except J. Folkman, who based his proof on van der Waerden's theorem. The paper also contains the first published statement of the countable v…

2017-12-11math.CO

Regular bipartite graphs and intersecting families

In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and Tokushige. Several new stronger results are also obtained. Our approach is based on the use of regular bipartite graphs. These graphs are quite often used in Extremal Set Theory problems, however, …

2017-10-18cs.DMmath.CO

Asymmetric Ramsey Properties of Random Graphs for Cliques and Cycles

We say that $G \to (F,H)$ if, in every edge colouring $c: E(G) \to \{1,2\}$, we can find either a $1$-coloured copy of $F$ or a $2$-coloured copy of $H$. The well-known Kohayakawa--Kreuter conjecture states that the threshold for the property $G(n,p) \to (F,H)$ is equal to $n^{-1/m_{2}(F,H)}$, where $m_{2}(F,H)$ is given by \[ m_{2}(F,H):= \max \left\{\dfrac{e(J)}{v(J)-2+1/m_2(H)} : J \subseteq F, e(J)\ge 1 \right\}. \] In this paper, we show the $0$-statement of the Kohayakawa--Kreuter conjecture for every pair of cycles and cliques.

2020-10-22math.COmath.PR

带偏序集参数的无限组合语句

An infinite combinatorial statement with a poset parameter

本文引入了无限组合学中经典关系（k，n，l）--> r的一个扩张，它以一个偏序集P和基数k，l为指标，记为（k，l）-->P.根据定义，（k，n，l）--> r成立，如果从k的n元子集到k的具有小于l个元素的子集的每个映射都有r元自由集。例如，库拉托斯基的自由集定理指出（k，n，l）-->n+1成立当且仅当k大于或等于无限基数k的第n个基数后继l^{+n}。利用（k，l）-->P框架，给出了第一作者的结果（l^{+n}，n，l）-->n+2的一个完备证明，其中对任意无穷基数l和任意正整数n，解决了Erdös，Hajnal，Mate，and Rado在1985年专著中提出的一个问题.利用Hajnal和Spencer在1971年建立的序维数估计，证明了对于任意无穷基数l和所有正整数n和r，r大于1但小于n，关系（l^{+（n-1）}，r，l）--> 2 ^m，其中m是（1 - 2）（1-2^{-r}）^{-n/r}之下的最大整数.例如，（\aleph_{210}，4，\aleph_0）--> 32，768。其他阶维数估计产生的关系如（\aleph_{109}，4，\aleph_0）--> 257（使用Füredi和Kahn的估计）和（\aleph_7，4，\aleph_0）-->10（使用Dushnik的精确估计）。

2010-05-28math.COmath.GMmath.LO

关于具有非对称Ramsey性质的超图的注记

A note on hypergraphs with asymmetric Ramsey properties

Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院）

本文研究了超图的非对称Ramsey性质，证明了对于任意整数t₁≥…≥tₗ>r，存在一个r-超图G，使得G不包含K^{(r)}_{t₁},…,K^{(r)}_{tₗ}的单色复制，但包含K^{(r)}_s,K^{(r)}_{tₗ-1}的单色复制，其中s=R(K^{(r)}_{t₁},…,K^{(r)}_{tₗ})-1。

2026-05-20cs.DMmath.CO

Independent sets in hypergraphs and Ramsey properties of graphs and the integers

Many important problems in combinatorics and other related areas can be phrased in the language of independent sets in hypergraphs. Recently Balogh, Morris and Samotij, and independently Saxton and Thomason developed very general container theorems for independent sets in hypergraphs; both of which have seen numerous applications to a wide range of problems. In this paper we use the container method to give relatively short and elementary proofs of a number of results concerning Ramsey (and Turán) properties of (hyper)graphs and the integers. In particular: (i) We generalise the random Ramsey …

2018-11-27math.CO