1 citations · 1 across the 7 of their papers we have counts for
7 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…
On Ramsey number of Steiner systems
Ayush Basu, Daniel Dobak, Vojtěch Rödl +1
A -uniform hypergraph is called a partial -system if every set of vertices of is contained in at most one edge of . We prove the existence of a pa…
Coloring triangles in graphs
Ayush Basu, Vojtěch Rödl, Marcelo Sales
We study quantitative aspects of the following fact: For every graph , there exists a graph with the property that any -coloring of the triangles of yields an induced…
The number of cliques in hypergraphs with forbidden subgraphs
Ayush Basu, Vojtech Rodl, Yi Zhao
We study the maximum number of -vertex cliques in -uniform hypergraphs not containing complete -partite hypergraphs . By using the hyperg…
The -representation number of the random graph
Ayush Basu, Vojtěch Rödl, Marcelo Sales
The -representation number of a graph is the minimum cardinality of the system of vertex subsets with the property that every edge of is covered at least times while…
Note on set representation of bounded degree hypergaphs
Ayush Basu, Griffin Johnston, Vojtěch Rödl +1
In their classical paper, Erdős, Goodman and Pósa studied the representation of a graph with vertex set by a family of subsets with the property that $\{i,j\…