Author:
Black Alexander,Cetin Umur,Frick Florian,Pacun Alexander,Setiabrata Linus
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. R. Aharoni, N. Alon, E. Berger, M. Chudnovsky, D. Kotlar, M. Loebl and R. Ziv, Fair representation by independent sets, in A Journey Through Discrete Mathematics, Springer, Cham, 2017, pp. 31–58.
2. M. Alishahi and F. Meunier, Fair splitting of colored paths, Electronic Journal of Combinatorics 24 (2017), Article no. 3.41.
3. N. Alon, The linear arboricity of graphs, Israel Journal of Mathematics 62 (1988), 311–325.
4. N. Alon, Probabilistic methods in coloring and decomposition problems, Discrete Mathematics 127 (1994), 31–46.
5. N. Alon, L. Drewnowski and T. Luczak, Stable Kneser hypergraphs and ideals in N with the nikodym property, Proceedings of the American Mathematical Society 137 (2009), 467–471.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets;The Electronic Journal of Combinatorics;2023-07-28
2. The Complexity of Finding Fair Independent Sets in Cycles;computational complexity;2022-10-11
3. Constant inapproximability for PPA;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09