The following pages link to Graphs and matching theorems (Q766882):
Displaying 26 items.
- Critical sets in bipartite graphs (Q368442) (← links)
- Optimal and near-optimal broadcast in random graphs (Q921019) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Trees with 1-factors and oriented trees (Q1174177) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- The strong Hall property and symmetric chain orders (Q1301661) (← links)
- Independent transversals in \(r\)-partite graphs (Q1377695) (← links)
- Elementary strong maps and transversal geometries (Q1393251) (← links)
- Selling two goods optimally (Q1641015) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Some recent results in combinatorial approaches to dynamical systems (Q1823209) (← links)
- Chromatic polynomials and broken cycles (Q1843572) (← links)
- An improved linear connectivity bound for tournaments to be highly linked (Q1979428) (← links)
- Skew-amenability of topological groups (Q2071765) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Applications of Menger's graph theorem (Q2527630) (← links)
- Transversal theory and the study of abstract independence (Q2536527) (← links)
- Hall's criterion as a 'self-refining' result (Q2540556) (← links)
- Matching problems (Q2547562) (← links)
- Generalized versions of Hall's theorem (Q2550391) (← links)
- On distinct representatives and mapping theorems (Q2561217) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- Duality and Optimality of Auctions for Uniform Distributions (Q3133819) (← links)
- Graphs and Subgraphs (Q3241661) (← links)
- Matrices of zeros and ones (Q3276702) (← links)
- A probabilistic solution of problem 111. of G. Birkhoff (Q3293718) (← links)
