Author:
Aharoni Ron,Berger Eli,Kotlar Dani,Ziv Ran
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Adamaszek, M., Barmak, J.A.: On a lower bound for the connectivity of the independence complex of a graph. Discrete Math. 311, 2566–2569 (2011)
2. Aharoni, R., Alon, N., Berger, E.: Eigenvalues of
$$K_{1,k}$$
K
1
,
k
-free graphs and the connectivity of their independence complexes J. Graph Theory 83, 384–391 (2016)
3. Aharoni, R., Alon, N., Berger, E., Chudnovsky, M., Kotlar, D., Loebl, M., Ziv, R.: Fair representation by independent sets. Discrete Math (to appear)
4. Aharoni, R., Berger, E., Ziv, R.: Independent systems of representatives in weighted graphs. Combinatorica 27, 253–267 (2007)
5. Aharoni, R., Gorelik, I., Narins, L.: A bound on the connectivity of line graphs (unpublished)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New bounds for Ryser’s conjecture and related problems;Transactions of the American Mathematical Society, Series B;2022-04-15
2. Fairness in Temporal Slot Assignment;Algorithmic Game Theory;2022
3. Rainbow structures in locally bounded colorings of graphs;Random Structures & Algorithms;2020-01-13
4. A counterexample to Stein’s Equi-$n$-square Conjecture;Proceedings of the American Mathematical Society;2019-03-01
5. Topological methods for the existence of a rainbow matching;Electronic Notes in Discrete Mathematics;2017-12