English
Related papers

Related papers: An infinite quantum Ramsey theorem

200 papers

Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…

Combinatorics · Mathematics 2018-01-30 Dragan Masulovic

A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…

Combinatorics · Mathematics 2023-11-10 Sahar Diskin , Ilay Hoshen , Michael Krivelevich , Maksim Zhukovskii

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

Combinatorics · Mathematics 2020-10-26 Sergey Bezuglyi , Palle E. T. Jorgensen

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

Logic · Mathematics 2026-05-12 Ahmed Mimouni , Ludovic Patey

A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\rho$, every graph $G$ with sufficiently large $\rho(G)$ contains a `well-structured' induced subgraph $H$ with…

Combinatorics · Mathematics 2018-08-15 Ilkyoo Choi , Michitaka Furuya , Ringi Kim , Boram Park

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Combinatorics · Mathematics 2020-07-21 Hendrik Heine

We define a collection of topological Ramsey spaces consisting of equivalence relations on $\omega$ with the property that the minimal representatives of the equivalence classes alternate according to a fixed partition of $\omega$. To prove…

Logic · Mathematics 2021-12-14 Jamal K. Kawach , Stevo Todorcevic

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Logic · Mathematics 2018-03-20 Ludovic Patey , Keita Yokoyama

Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to…

Combinatorics · Mathematics 2008-06-19 Oliver Cooley , Nikolaos Fountoulakis , Daniela Kühn , Deryk Osthus

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

Combinatorics · Mathematics 2014-04-02 Johannes Carmesin

The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…

Combinatorics · Mathematics 2025-11-14 Lucas Aragão , Marcelo Campos , Gabriel Dahia , Rafael Filipe , João Pedro Marciano

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

Combinatorics · Mathematics 2018-03-28 Peter Nelson , Sophia Park

We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence…

Rings and Algebras · Mathematics 2024-11-13 Ivan-Vanja Boroja , Damjana Kokol Bukovšek , Nik Stopar

A simple proof is provided to show that any bounded normal operator on a real Hilbert space is orthogonally equivalent to its transpose(adjoint). A structure theorem for invertible skew-symmetric operators, which is analogous to the finite…

Spectral Theory · Mathematics 2020-04-21 B V Rajarama Bhat , Tiju Cherian John

The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…

Combinatorics · Mathematics 2008-12-11 Tomi Mikkonen

We construct rational projective 4-dimensional varieties with the property that certain Lawson homology groups tensored with Q are infinite dimensional Q-vector spaces. More generally, each pair of integers p and k, with k\geq 0, p>0, we…

Algebraic Geometry · Mathematics 2007-05-23 Wenchuan Hu

We introduce unbounded strongly irreducible operators and transitive operators. These operators are related to a certain class of indecomposable Hilbert representations of quivers on infinite-dimensional Hilbert spaces. We regard the theory…

Functional Analysis · Mathematics 2016-03-28 Masatoshi Enomoto , Yasuo Watatani

We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…

Functional Analysis · Mathematics 2018-10-15 Masatoshi Enomoto , Yasuo Watatani

We show that the big Ramsey degrees of every countable universal $u$-uniform $\omega$-edge-labeled hypergraph are infinite for every $u\geq 2$. Together with a recent result of Braunfeld, Chodounsk\'y, de Rancourt, Hubi\v{c}ka, Kawach, and…

Combinatorics · Mathematics 2025-10-01 Jan Hubička , Matěj Konečný , Stevo Todorcevic , Andy Zucker