Hall-type theorems for hypergraphs (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hall-type theorems for hypergraphs" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

16worldcat.org

5^th place

11semanticscholar.org

11^th place

8^th place

7arxiv.org

69^th place

59^th place

1wiley.com

222^nd place

297^th place

1gilkalai.wordpress.com

low place

1ams.org

451^st place

277^th place

ams.org (Global: 451^st place; English: 277^th place)

Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15). "New bounds for Ryser's conjecture and related problems". Transactions of the American Mathematical Society, Series B. 9 (8): 288–321. arXiv:2005.00526. doi:10.1090/btran/92. ISSN 2330-0000.

arxiv.org (Global: 69^th place; English: 59^th place)

Annamalai, Chidambaram (2015-12-21), "Finding Perfect Matchings in Bipartite Hypergraphs", Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 1814–1823, arXiv:1509.07007, doi:10.1137/1.9781611974331.ch126, ISBN 978-1-61197-433-1
Annamalai Chidambaram; Kalaitzis Christos; Svensson Ola (2017-05-26). "Combinatorial Algorithm for Restricted Max-Min Fair Allocation". ACM Transactions on Algorithms. 13 (3): 1–28. arXiv:1409.0607. doi:10.1145/3070694. S2CID 14749011.
Davies, Sami; Rothvoss, Thomas; Zhang, Yihao (2019-12-23), "A Tale of Santa Claus, Hypergraphs and Matroids", Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2748–2757, arXiv:1807.07189, doi:10.1137/1.9781611975994.167, ISBN 978-1-61197-599-4, S2CID 49880727
Aharoni, Ron; Berger, Eli; Briggs, Joseph; Segal-Halevi, Erel; Zerbib, Shira (2020-11-02). "Fractionally balanced hypergraphs and rainbow KKM theorems". arXiv:2011.01053 [math.CO].
Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15). "New bounds for Ryser's conjecture and related problems". Transactions of the American Mathematical Society, Series B. 9 (8): 288–321. arXiv:2005.00526. doi:10.1090/btran/92. ISSN 2330-0000.
Montgomery, Richard (2023). "A proof of the Ryser-Brualdi-Stein conjecture for large even n". arXiv:2310.19779 [math.CO].
Aharoni, Ron; Berger, Eli; Kotlar, Dani; Ziv, Ran (2017-01-04). "On a conjecture of Stein". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2): 203–211. arXiv:1605.01982. doi:10.1007/s12188-016-0160-3. ISSN 0025-5858. S2CID 119139740.

doi.org (Global: 2^nd place; English: 2^nd place)

Aharoni, Ron; Kessler, Ofra (1990-10-15). "On a possible extension of Hall's theorem to bipartite hypergraphs". Discrete Mathematics. 84 (3): 309–313. doi:10.1016/0012-365X(90)90136-6. ISSN 0012-365X.
Aharoni, Ron (1985-12-01). "Matchings inn-partiten-graphs". Graphs and Combinatorics. 1 (1): 303–304. doi:10.1007/BF02582958. ISSN 1435-5914. S2CID 19258298.
Aharoni, Ron (1993-06-01). "On a criterion for matchability in hypergraphs". Graphs and Combinatorics. 9 (2): 209–212. doi:10.1007/BF02988309. ISSN 1435-5914. S2CID 29126477.
Haxell, P.E. (1995-09-01). "A condition for matchability in hypergraphs". Graphs and Combinatorics. 11 (3): 245–248. doi:10.1007/bf01793010. S2CID 28459229.
Aharoni, Ron; Haxell, Penny (2000). "Hall's theorem for hypergraphs". Journal of Graph Theory. 35 (2): 83–88. doi:10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V. ISSN 1097-0118.
Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912. S2CID 207006642.
Annamalai, Chidambaram (2015-12-21), "Finding Perfect Matchings in Bipartite Hypergraphs", Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 1814–1823, arXiv:1509.07007, doi:10.1137/1.9781611974331.ch126, ISBN 978-1-61197-433-1
Asadpour Arash; Feige Uriel; Saberi Amin (2012-07-24). "Santa claus meets hypergraph matchings". ACM Transactions on Algorithms. 8 (3): 1–9. doi:10.1145/2229163.2229168. S2CID 10281304.
Annamalai Chidambaram; Kalaitzis Christos; Svensson Ola (2017-05-26). "Combinatorial Algorithm for Restricted Max-Min Fair Allocation". ACM Transactions on Algorithms. 13 (3): 1–28. arXiv:1409.0607. doi:10.1145/3070694. S2CID 14749011.
Davies, Sami; Rothvoss, Thomas; Zhang, Yihao (2019-12-23), "A Tale of Santa Claus, Hypergraphs and Matroids", Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2748–2757, arXiv:1807.07189, doi:10.1137/1.9781611975994.167, ISBN 978-1-61197-599-4, S2CID 49880727
Aharoni, Ron (2001-01-01). "Ryser's Conjecture for Tripartite 3-Graphs". Combinatorica. 21 (1): 1–4. doi:10.1007/s004930170001. ISSN 1439-6912. S2CID 13307018.
Meshulam, Roy (2003-05-01). "Domination numbers and homology". Journal of Combinatorial Theory. Series A. 102 (2): 321–330. doi:10.1016/S0097-3165(03)00045-1. ISSN 0097-3165.
Koksma, Klaas K. (1969-07-01). "A lower bound for the order of a partial transversal in a latin square". Journal of Combinatorial Theory. 7 (1): 94–95. doi:10.1016/s0021-9800(69)80009-8. ISSN 0021-9800.
Woolbright, David E (1978-03-01). "An n × n Latin square has a transversal with at least n−n distinct symbols". Journal of Combinatorial Theory. Series A. 24 (2): 235–237. doi:10.1016/0097-3165(78)90009-2. ISSN 0097-3165.
Hatami, Pooya; Shor, Peter W. (2008-10-01). "A lower bound for the length of a partial transversal in a Latin square". Journal of Combinatorial Theory. Series A. 115 (7): 1103–1113. doi:10.1016/j.jcta.2008.01.002. ISSN 0097-3165.
Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15). "New bounds for Ryser's conjecture and related problems". Transactions of the American Mathematical Society, Series B. 9 (8): 288–321. arXiv:2005.00526. doi:10.1090/btran/92. ISSN 2330-0000.
Aharoni, Ron; Berger, Eli; Kotlar, Dani; Ziv, Ran (2017-01-04). "On a conjecture of Stein". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2): 203–211. arXiv:1605.01982. doi:10.1007/s12188-016-0160-3. ISSN 0025-5858. S2CID 119139740.
Stein, Sherman (1975-08-01). "Transversals of Latin squares and their generalizations". Pacific Journal of Mathematics. 59 (2): 567–575. doi:10.2140/pjm.1975.59.567. ISSN 0030-8730.
Aharoni, Ron; Berger, Eli (2009-09-25). "Rainbow Matchings in $r$-Partite $r$-Graphs". The Electronic Journal of Combinatorics. 16 (1) R119. doi:10.37236/208. ISSN 1077-8926.
Conforti, Michele; Cornuéjols, Gérard; Kapoor, Ajai; Vušković, Kristina (1996-09-01). "Perfect matchings in balanced hypergraphs". Combinatorica. 16 (3): 325–329. doi:10.1007/BF01261318. ISSN 1439-6912. S2CID 206792822.
Huck, Andreas; Triesch, Eberhard (2002-07-01). "Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach". Combinatorica. 22 (3): 409–416. doi:10.1007/s004930200020. ISSN 1439-6912. S2CID 34490040.

gilkalai.wordpress.com (Global: low place; English: low place)

Kalai, Gil (2012-11-25). "Happy Birthday Ron Aharoni!". Combinatorics and more. Retrieved 2020-06-30.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Aharoni, Ron (1985-12-01). "Matchings inn-partiten-graphs". Graphs and Combinatorics. 1 (1): 303–304. doi:10.1007/BF02582958. ISSN 1435-5914. S2CID 19258298.
Aharoni, Ron (1993-06-01). "On a criterion for matchability in hypergraphs". Graphs and Combinatorics. 9 (2): 209–212. doi:10.1007/BF02988309. ISSN 1435-5914. S2CID 29126477.
Haxell, P.E. (1995-09-01). "A condition for matchability in hypergraphs". Graphs and Combinatorics. 11 (3): 245–248. doi:10.1007/bf01793010. S2CID 28459229.
Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912. S2CID 207006642.
Asadpour Arash; Feige Uriel; Saberi Amin (2012-07-24). "Santa claus meets hypergraph matchings". ACM Transactions on Algorithms. 8 (3): 1–9. doi:10.1145/2229163.2229168. S2CID 10281304.
Annamalai Chidambaram; Kalaitzis Christos; Svensson Ola (2017-05-26). "Combinatorial Algorithm for Restricted Max-Min Fair Allocation". ACM Transactions on Algorithms. 13 (3): 1–28. arXiv:1409.0607. doi:10.1145/3070694. S2CID 14749011.
Davies, Sami; Rothvoss, Thomas; Zhang, Yihao (2019-12-23), "A Tale of Santa Claus, Hypergraphs and Matroids", Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 2748–2757, arXiv:1807.07189, doi:10.1137/1.9781611975994.167, ISBN 978-1-61197-599-4, S2CID 49880727
Aharoni, Ron (2001-01-01). "Ryser's Conjecture for Tripartite 3-Graphs". Combinatorica. 21 (1): 1–4. doi:10.1007/s004930170001. ISSN 1439-6912. S2CID 13307018.
Aharoni, Ron; Berger, Eli; Kotlar, Dani; Ziv, Ran (2017-01-04). "On a conjecture of Stein". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2): 203–211. arXiv:1605.01982. doi:10.1007/s12188-016-0160-3. ISSN 0025-5858. S2CID 119139740.
Conforti, Michele; Cornuéjols, Gérard; Kapoor, Ajai; Vušković, Kristina (1996-09-01). "Perfect matchings in balanced hypergraphs". Combinatorica. 16 (3): 325–329. doi:10.1007/BF01261318. ISSN 1439-6912. S2CID 206792822.
Huck, Andreas; Triesch, Eberhard (2002-07-01). "Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach". Combinatorica. 22 (3): 409–416. doi:10.1007/s004930200020. ISSN 1439-6912. S2CID 34490040.

wiley.com (Global: 222^nd place; English: 297^th place)

onlinelibrary.wiley.com

Aharoni, Ron; Haxell, Penny (2000). "Hall's theorem for hypergraphs". Journal of Graph Theory. 35 (2): 83–88. doi:10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V. ISSN 1097-0118.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Aharoni, Ron; Kessler, Ofra (1990-10-15). "On a possible extension of Hall's theorem to bipartite hypergraphs". Discrete Mathematics. 84 (3): 309–313. doi:10.1016/0012-365X(90)90136-6. ISSN 0012-365X.
Aharoni, Ron (1985-12-01). "Matchings inn-partiten-graphs". Graphs and Combinatorics. 1 (1): 303–304. doi:10.1007/BF02582958. ISSN 1435-5914. S2CID 19258298.
Aharoni, Ron (1993-06-01). "On a criterion for matchability in hypergraphs". Graphs and Combinatorics. 9 (2): 209–212. doi:10.1007/BF02988309. ISSN 1435-5914. S2CID 29126477.
Aharoni, Ron; Haxell, Penny (2000). "Hall's theorem for hypergraphs". Journal of Graph Theory. 35 (2): 83–88. doi:10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V. ISSN 1097-0118.
Meshulam, Roy (2001-01-01). "The Clique Complex and Hypergraph Matching". Combinatorica. 21 (1): 89–94. doi:10.1007/s004930170006. ISSN 1439-6912. S2CID 207006642.
Aharoni, Ron (2001-01-01). "Ryser's Conjecture for Tripartite 3-Graphs". Combinatorica. 21 (1): 1–4. doi:10.1007/s004930170001. ISSN 1439-6912. S2CID 13307018.
Meshulam, Roy (2003-05-01). "Domination numbers and homology". Journal of Combinatorial Theory. Series A. 102 (2): 321–330. doi:10.1016/S0097-3165(03)00045-1. ISSN 0097-3165.
Koksma, Klaas K. (1969-07-01). "A lower bound for the order of a partial transversal in a latin square". Journal of Combinatorial Theory. 7 (1): 94–95. doi:10.1016/s0021-9800(69)80009-8. ISSN 0021-9800.
Woolbright, David E (1978-03-01). "An n × n Latin square has a transversal with at least n−n distinct symbols". Journal of Combinatorial Theory. Series A. 24 (2): 235–237. doi:10.1016/0097-3165(78)90009-2. ISSN 0097-3165.
Hatami, Pooya; Shor, Peter W. (2008-10-01). "A lower bound for the length of a partial transversal in a Latin square". Journal of Combinatorial Theory. Series A. 115 (7): 1103–1113. doi:10.1016/j.jcta.2008.01.002. ISSN 0097-3165.
Keevash, Peter; Pokrovskiy, Alexey; Sudakov, Benny; Yepremyan, Liana (2022-04-15). "New bounds for Ryser's conjecture and related problems". Transactions of the American Mathematical Society, Series B. 9 (8): 288–321. arXiv:2005.00526. doi:10.1090/btran/92. ISSN 2330-0000.
Aharoni, Ron; Berger, Eli; Kotlar, Dani; Ziv, Ran (2017-01-04). "On a conjecture of Stein". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2): 203–211. arXiv:1605.01982. doi:10.1007/s12188-016-0160-3. ISSN 0025-5858. S2CID 119139740.
Stein, Sherman (1975-08-01). "Transversals of Latin squares and their generalizations". Pacific Journal of Mathematics. 59 (2): 567–575. doi:10.2140/pjm.1975.59.567. ISSN 0030-8730.
Aharoni, Ron; Berger, Eli (2009-09-25). "Rainbow Matchings in $r$-Partite $r$-Graphs". The Electronic Journal of Combinatorics. 16 (1) R119. doi:10.37236/208. ISSN 1077-8926.
Conforti, Michele; Cornuéjols, Gérard; Kapoor, Ajai; Vušković, Kristina (1996-09-01). "Perfect matchings in balanced hypergraphs". Combinatorica. 16 (3): 325–329. doi:10.1007/BF01261318. ISSN 1439-6912. S2CID 206792822.
Huck, Andreas; Triesch, Eberhard (2002-07-01). "Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach". Combinatorica. 22 (3): 409–416. doi:10.1007/s004930200020. ISSN 1439-6912. S2CID 34490040.

Hall-type theorems for hypergraphs (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)