7 papers · 1 filter
On Colorful Kruskal--Katona Theorems
Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu
What is the maximum number of rainbow triangles in an edge-colored graph with edges and colors? Using entropic techniques, we prove an upper bound of rainbow t…
A Jump in the Codegree Turán Densities of Long Tight Cycles
József Balogh, Haoran Luo, Maya Sankar
We study the codegree Turán density of , the -uniform hypergraph tight cycle of length . A result of Han, Lo, and Sanhueza-Matamala states that if $\el…
Rainbow Trees in Hypercubes
Nicholas Crawford, Maya Sankar, Carl Schildkraut +1
We prove that every proper edge-coloring of the -dimensional hypercube contains a rainbow copy of every tree on at most edges. This result is best possible, as $Q_…
The Turán Density of 4-Uniform Tight Cycles
Maya Sankar
For any uniformity and residue modulo , we give an exact characterization of the -uniform hypergraphs that homomorphically avoid tight cycles of length modulo …
An Improved Turán Exponent for 2-Complexes
Maya Sankar
The topological Turán number of a 2-dimensional simplicial complex asks for the maximum number of edges in an -vertex 3-uniform hypergraph containi…
Generalized Ramsey--Turán density for cliques
Jun Gao, Suyun Jiang, Hong Liu +1
We study the generalized Ramsey--Turán function , which is the maximum possible number of copies of in an -vertex -free graph with indepe…
Ramsey and Turán numbers of sparse hypergraphs
Jacob Fox, Maya Sankar, Michael Simkin +2
Degeneracy plays an important role in understanding Turán- and Ramsey-type properties of graphs. Unfortunately, the usual hypergraphical generalization of degeneracy fails to captu…