3 citations · 7 across the 12 of their papers we have counts for
5 papers · 1 filter
New constructions of unbalanced -free bipartite graphs
Baran Düzgün, Ago-Erik Riet, Vladislav Taranchuk
In 1979, Erdős conjectured that if , then . This conjecture was disproven by several papers and the current best-known bounds for th…
Maximal sets of -spaces pairwise intersecting in at least a -space
Jozefien D'haeseleer, Giovanni Longobardi, Ago-Erik Riet +1
In this paper, we analyze the structure of maximal sets of -dimensional spaces in pairwise intersecting in at least a -dimensional space, for $3 \leq k…
New -Saturation Games on Directed Graphs
Jonathan D. Lee, Ago-Erik Riet
We study analogues of -saturation games, first introduced by Furedi, Reimer and Seress in 1991, and named as such by West. We examine analogous games on directed graph…
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…
Completing Partial Packings of Bipartite Graphs
Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn
Given a bipartite graph and an integer , let be the smallest integer such that, any set of edge disjoint copies of on vertices, can be extended to an -de…