7 citations · 7 across the 10 of their papers we have counts for
25 papers
Regularity method for hypergraphs with -cycle-free links
Ayush Basu, Christian Reiher, Vojtěch Rödl +1
We extend the hypergraph regularity method to sparse -uniform hypergraphs whose vertex links are -free. In other words, we consider hypergraphs that are $K_{1,2,2…
Canonical Ramsey theorem for graphs with clean intersections
Matías Azócar Carvajal, Ayush Basu, Christian Reiher +3
Extending earlier results of Nešetřil and Rödl [Selective graphs and hypergraphs, Ann. Discrete Math. 3 (1978), 181--189], we show that for every ordered graph there exist an o…
Linearly distributive coherence in the absence of units
Max Demirdilek, Christian Reiher, Christoph Schweigert
Coherence in a monoidal category asserts that all morphisms built from structural isomorphisms with a fixed source and target coincide. These structural isomorphisms include, in pa…
Large sum-free sets in finite vector spaces II
Christian Reiher, Sofia Zotova
Answering a question of Leo Versteegen, we prove that for every sum-free set with is either contained in the union of t…
The complete picture for clique factors in randomly perturbed graphs
Sylwia Antoniuk, Nina Kamčev, Christian Reiher +1
A randomly perturbed graph is obtained by taking a deterministic -vertex graph with minimum degree and adding the edges of th…
Unavoidable subgraphs in Ramsey graphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
We study subgraphs that appear in large Ramsey graphs for a given graph . The recent girth Ramsey theorem of the first two authors asserts that there are Ramsey graphs such that…