Finding Perfect Matchings in Bipartite Hypergraphs

被引：0
|
作者：
Chidambaram Annamalai
机构：
[1] ETH Zurich,Department of Computer Science
来源：
Combinatorica | 2018年 / 38卷
关键词：
05C65; 05C70; 05C85;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：1285 / 1307
页数：22
相关论文
共 50 条
  • [31] A fast algorithm for enumerating bipartite perfect matchings
    Uno, T
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 367 - 379
  • [32] Existence of perfect matchings in a plane bipartite graph
    Zhongyuan Che
    [J]. Czechoslovak Mathematical Journal, 2010, 60 : 489 - 494
  • [33] Perfect matchings and ears in elementary bipartite graphs
    Hansen, P
    Zhang, FJ
    Zheng, ML
    [J]. DISCRETE MATHEMATICS, 1997, 176 (1-3) : 131 - 138
  • [34] RAINBOW PERFECT MATCHINGS FOR 4-UNIFORM HYPERGRAPHS
    Hongliang, Lu
    Yan, Wang
    Xingxing, Yu
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) : 1645 - 1662
  • [35] Polynomial-time perfect matchings in dense hypergraphs
    Keevash, Peter
    Knox, Fiachra
    Mycroft, Richard
    [J]. ADVANCES IN MATHEMATICS, 2015, 269 : 265 - 334
  • [36] Near Perfect Matchings in k-Uniform Hypergraphs
    Han, Jie
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (05): : 723 - 732
  • [37] Disjoint perfect matchings in 3-uniform hypergraphs
    Lu, Hongliang
    Yu, Xingxing
    Zhang, Li
    [J]. JOURNAL OF GRAPH THEORY, 2018, 88 (02) : 284 - 293
  • [38] PERFECT MATCHINGS IN RANDOM S-UNIFORM HYPERGRAPHS
    FRIEZE, A
    JANSON, S
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 7 (01) : 41 - 57
  • [39] A NOTE ON COLOR-BIAS PERFECT MATCHINGS IN HYPERGRAPHS
    Balogh, József
    Treglown, Andrew
    Zárate-Guerén, Camila
    [J]. SIAM Journal on Discrete Mathematics, 2024, 38 (04) : 2543 - 2552
  • [40] Perfect matchings in uniform hypergraphs with large minimum degree
    Rodl, Vojtech
    Rucinski, Andrzej
    Szemeredi, Endre
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (08) : 1333 - 1349
12345