Transversal theory. An account of some aspects of combinatorial mathematics

Publication date: 1971

Published in: Mathematics in Science and Engineering (Search for Journal in Brave)

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items

R. Thompson’s group and the amenability problem, Properties of finite character of independence spaces, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Amenability of Groups and G-Sets, On a classification of independence systems, A construction of group divisible designs, On a classification of independence systems, The structure of Sperner k-families, Embedding complete trees into the hypercube, Injective choice functions, A minimal completion of (0, 1)-matrices without total support, The structure of Sperner k-families, Regular (2, 2)-systems, Linear Transformations on Nonnegative Matrices Preserving Properties of Irreducibility and Full Indecomposability, Cardinality constraints and systems of restricted representatives, On a conjecture of Marcus and de Oliveira, The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Compatible systems of representatives, Independence spaces and uniform modules, König's theorem and bimatroids, Constructing integral matrices with given line sums, Gardens of Eden and amenability on cellular automata, Packing bipartite graphs, Antimagic labeling of some biregular bipartite graphs, Simple existence conditions for zero-one matrices with at most one structural zero in each row and column, Symmetric chain partitions of orthocomplemented posets, On the number of SDR of a (t,n)-family, Colouring paths in directed symmetric trees with applications to WDM routing, A necessary and sufficient condition for unique skill assessment, Hall-conditions and the three-family problem, Newton flows for elliptic functions. II: Structural stability: classification and representation, On Ryser's maximum term rank formula, Elementary strong maps and transversal geometries, Unnamed Item, A short proof of the existence of k-saturated partitions of partially ordered sets, Matchings in random regular bipartite digraphs, Total unimodularity and combinatorial theorems, Matrices of zeros and ones with fixed row and column sum vectors, A polyhedral approach to the \textit{alldifferent} system, On Haber's minimum term rank formula, Vector transversals, Extending the Greene-Kleitman theorem to directed graphs, Matchings in infinite graphs, On the permanents of complements of the direct sum of identity matrices, Mixed discriminants of positive semidefinite matrices, A Bruhat order for bipartite graphs whose node sets are posets: Lifting, switching, and adding edges, Matrices of 0's and 1's with total support, A conjecture on the number of SDRs of a \((t,n)\)-family, A canonical construction for nonnegative integral matrices with given line sums, Generalizing quasi-ordinal knowledge spaces to polytomous items, Maximum and minimum jump number of posets from matrices, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, The notion and basic properties of \(M\)-transversals, Transversal theory and F-products, Some isomorphisms between pairs of latin squares, Truncations of principal geometries, Marriage in denumerable societies, Independent transversals for countable set systems, Some properties of inclusions of multisets and contractive Boolean operators, Ergebnisse aus der Transversalentheorie. I, II, On the number of systems of distinct representatives in an independence structure, Notes on circuit spaces, Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs, Convexity spaces. III: Dimension, On the rank function for infinite sets, Synergy of homomorphisms in relational systems, Some combinatorial properties of centrosymmetric matrices, On the classification of plane graphs representing structurally stable rational Newton flows, Some characterization theorems for circuit spaces associated with graphs, Transversal theory and rank functions, The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov, A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals, Balanced sets and circuits in a transversal space, On the truncated assignment polytope, Ordered open planes, Über ein graphentheoretisches Ergebnis von T. Gallai, A product of matroids and its automorphism group, A marriage theorem with Lebesgue measure, On Fundamental Transversal Matroids, The Bracket Ring of a Combinatorial Geometry. I, On a packing problem for infinite graphs and independence spaces, The cyclic wirelength of trees, Hall exponents of Boolean matrices, Lineare Algebra über Fastkörpern, On Latin squares and the facial structure of related polytopes, U-optimum row-columns designs for the comparison of two treatments, 1-Faktoren von Graphen. (1-factors of graphs), Spectral stability of metric-measure Laplacians, A matroid generalization of a theorem of Mendelsohn and Dulmage, Zur quantitativen Theorie der Gleichverteilung, On a distribution problem in finite and countable sets, Gammoids and transversal matroids, Transversals of infinite families, The rank formula of Nash-Williams as a source of covering and packing theorems, Degree of indecomposability of certain highly regular zero-one matrices, Colouring proximity graphs in the plane, Sufficient regularity conditions for common transversals, On the finite completion of partial latin cubes, Balanced sets in an independence structure induced by a submodular function, Superspaces of (s) with strong finite dimensional decomposition, A substitute for Hall's theorem for families with infinite sets, Subgraphs of graphs. I, Extending Latin rectangles with restraints, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, On fuzzification of matroids, The class of matrices of zeros, ones, and twos with prescribed row and column sums, Three dimensional line stochastic matrices and extreme points, Degree and local connectivity in digraphs, Whitney's theorem for infinite graphs, On the rotation distance of graphs, Combinatorics of reductions between equivalence relations, On effectively computable realizations of choice functions, Some sequences associated with combinatorial structures, A bound for the determinant of certain Hadamard products and for the determinant of the sum of two normal matrices