Geometric Systems of Disjoint Representatives
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Domination numbers and homology
Journal of Combinatorial Theory Series A
A Note on Vertex List Colouring
Combinatorics, Probability and Computing
A revival of the girth conjecture
Journal of Combinatorial Theory Series B
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Odd Independent Transversals are Odd
Combinatorics, Probability and Computing
The circular chromatic index of graphs of high girth
Journal of Combinatorial Theory Series B
Approximation algorithms for spreading points
Journal of Algorithms
Independence---domination duality
Journal of Combinatorial Theory Series B
Santa Claus Meets Hypergraph Matchings
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fractional decompositions of dense hypergraphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximation algorithms for spreading points
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Santa claus meets hypergraph matchings
ACM Transactions on Algorithms (TALG)
Projective dimension, graph domination parameters, and independence complex homology
Journal of Combinatorial Theory Series A
European Journal of Combinatorics
Systems of distant representatives in euclidean space
Proceedings of the twenty-ninth annual symposium on Computational geometry
Monochromatic components in edge-colored complete uniform hypergraphs
European Journal of Combinatorics
| Hi-index | 0.00 |
We prove a hypergraph version of Hall's theorem. The proof is topological. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 83–88, 2000