Some Results on Matching in Bipartite Graphs
From MaRDI portal
Publication:5578820
DOI10.1137/0117090zbMath0187.21403OpenAlexW1998340201MaRDI QIDQ5578820
Lawrence H. Harper, Ronald L. Graham
Publication date: 1969
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0117090
Related Items
Integer partitions and the Sperner property, On the average rank of LYM-sets, Matchings, cutsets, and chain partitions in graded posets, Families of chains of a poset and Sperner properties, Optimal representations of partially ordered sets and a limit Sperner theorem, Maximum antichains of rectangular arrays, On nested chain decompositions of normalized matching posets of rank 3, Morphisms for resistive electrical networks, The global theory of flows in networks, The convex hull of antichains in posets, Nested chain partitions of LYM posets, Maximum antichains in the product of chains, On Kruskal's cascades and counting containments in a set of subsets, The normalized matching property in random and pseudorandom bipartite graphs, On a problem of Rota, Maximum antichains in the partition lattice, The size of the largest antichain in the partition lattice, The symmetric group, ordered by refinement of cycles, is strongly Sperner, Avoiding brooms, forks, and butterflies in the linear lattices, Some remarks on normalized matching
