Author:
Alon Noga,Spencer Joel,Tetali Prasad
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. The strong chromatic number of a graph;Alon;Random Structures Algorithms,1992
2. The Probabilistic Method;Alon,1991
3. An algorithmic approach to the Lovász local lemma I;Beck;Random Structures Algorithms,1991
4. Latin Squares and their Applications;Denes,1974
5. Has every Latin square of order n a partial Latin transversal of size n − 1?;Erdös;Amer. Math. Monthly,1988
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decompositions into isomorphic rainbow spanning trees;Journal of Combinatorial Theory, Series B;2021-01
2. A rainbow blow‐up lemma;Random Structures & Algorithms;2020-02-20
3. Decompositions into spanning rainbow structures;Proceedings of the London Mathematical Society;2019-04-09
4. A counterexample to Stein’s Equi-$n$-square Conjecture;Proceedings of the American Mathematical Society;2019-03-01
5. Transversals in Latin Arrays with Many Distinct Symbols;Journal of Combinatorial Designs;2017-07-17