4 papers
math.CO2026
Counting Near-Spanning Matchings in Latin Squares and Steiner Triple Systems
Yantao Tang, Yi Zhao
Montgomery recently proved that for sufficiently large , every Latin square of order has a partial transversal with cells, and every Steiner triple system of order …
math.CO2026
Tripartite Zarankiewicz numbers and norm graphs
Yantao Tang, Yi Zhao
For fixed integers , let denote the maximum number of edges in a tripartite -free graph with vertices in each part. When…
math.CO2025
Number of independent transversals in multipartite graphs
Yantao Tang, Yi Zhao
An independent transversal in a multipartite graph is an independent set that intersects each part in exactly one vertex. We show that for every even integer , there exist…
math.CO2024
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…