1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2008
Factors in random graphs
A. Johansson, J. Kahn, V. Vu
Let be a fixed graph on vertices. For an -vertex graph with divisible by , an -{\em factor} of is a collection of copies of whose vertex sets…
math.CO2004★ 1 cited
Orthogonal latin rectangles
Roland Häggkvist, Anders Johansson
We use a greedy probabilistic method to prove that for every , every Latin rectangle on symbols has an orthogonal mate, where . That is, we show the…