Author:
Gao Jun,Lu Hongliang,Ma Jie,Yu Xingxing
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Aharoni R, Howard D. Size conditions for the existence of rainbow matchings. http://math.colgate.edu/~dmhoward/rsc.pdf
2. Akiyama J, Frankl P. On the size of graphs with complete-factors. J Graph Theory, 1985, 9: 197–201
3. Alon N, Frankl P, Huang H, et al. Large matchings in uniform hypergraphs and the conjecture of Erdős and Samuels. J Combin Theory Ser A, 2012, 119: 1200–1215
4. Alon N, Spencer J. The Probabilistic Method, 3rd ed. Hoboken: John Wiley & Sons, 2000
5. Bollobás B, Daykin D E, Erdős P. Sets of independent edges of a hypergraph. Q J Math, 1976, 27: 25–32
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fair Division via Quantile Shares;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. A 2-Stable Family of Triple Systems;The Electronic Journal of Combinatorics;2024-04-05
3. A family of 4-uniform hypergraphs with no stability;SCIENTIA SINICA Mathematica;2024-03-01
4. Co-degree threshold for rainbow perfect matchings in uniform hypergraphs;Journal of Combinatorial Theory, Series B;2023-11
5. Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs;SIAM Journal on Discrete Mathematics;2023-08-31