Combinatorial Configurations

Abstract

Previous article Next article Combinatorial ConfigurationsH. J. RyserH. J. Ryserhttps://doi.org/10.1137/0117056PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] R. P. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Math. (2), 51 (1950), 161–166 MR0032578 0038.02003 CrossrefISIGoogle Scholar[2] D. R. Fulkerson and , O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), 835–855 MR0186421 0132.21001 CrossrefISIGoogle Scholar[3] Hugo Hadwiger and , Hans Debrunner, Combinatorial geometry in the plane, Translated by Victor Klee. With a new chapter and other additional material supplied by the translator, Holt, Rinehart and Winston, New York, 1964vii+113 MR0164279 Google Scholar[4] Marshall Hall, Jr., Combinatorial theory, Blaisdell Publishing Co. Ginn and Co., Waltham, Mass.-Toronto, Ont.-London, 1967x+310 MR0224481 0196.02401 Google Scholar[5] Paul R. Halmos and , Herbert E. Vaughan, The marriage problem, Amer. J. Math., 72 (1950), 214–215 MR0033330 0034.29601 CrossrefISIGoogle Scholar[6] Gian-Carlo Rota and , L. H. Harper, Matching theory, an introductionAdvances in Probability and Related Topics, Vol. 1, Dekker, New York, 1971, 169–215 MR0282855 0234.05001 Google Scholar[7] Micha A. Perles, A proof of Dilworth's decomposition theorem for partially ordered sets, Israel J. Math., 1 (1963), 105–107 MR0168496 0115.01702 CrossrefISIGoogle Scholar[8] Herbert John Ryser, Combinatorial mathematics, The Carus Mathematical Monographs, No. 14, Published by The Mathematical Association of America, 1963xiv+154 MR0150048 0112.24806 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Cyclic arrangements with minimum modulo m winding numbers14 March 2022 | Graphs and Combinatorics, Vol. 38, No. 3 Cross Ref Configuration Space of Geometric Objects24 September 2018 | Cybernetics and Systems Analysis, Vol. 54, No. 5 Cross Ref Bipartite Graphs and Matrices26 November 2013 Cross Ref A characterization of (λ,2) -stable (0,1) matricesLinear Algebra and its Applications, Vol. 436, No. 4 Cross Ref Recognizing Helly Edge-Path-Tree graphs and their clique graphsDiscrete Applied Mathematics, Vol. 159, No. 11 Cross Ref Beyond the Pyramids: Rigid Clustering Systems Cross Ref Interval graphs Cross Ref An approach to solving Ak=J−ILinear Algebra and its Applications, Vol. 373 Cross Ref Totally positive matrices and totally positive hypergraphsLinear Algebra and its Applications, Vol. 331, No. 1-3 Cross Ref Forbidden configurations: Induction and linear algebraEuropean Journal of Combinatorics, Vol. 16, No. 5 Cross Ref Weighing Designs Cross Ref On joint realization of (0, 1) matricesLinear Algebra and its Applications, Vol. 112 Cross Ref Testing for class membership in multi-parent hierarchiesInformation Processing Letters, Vol. 28, No. 1 Cross Ref A forbidden configuration theorem of AlonJournal of Combinatorial Theory, Series A, Vol. 47, No. 1 Cross Ref Convexity in Graphs and HypergraphsMartin Farber and Robert E. Jamison17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 7, No. 3AbstractPDF (1622 KB)A characterization of totally balanced hypergraphsDiscrete Mathematics, Vol. 57, No. 1-2 Cross Ref General forbidden configuration theoremsJournal of Combinatorial Theory, Series A, Vol. 40, No. 1 Cross Ref Asymptotically optimal weighing designs with string propertyJournal of Statistical Planning and Inference, Vol. 12 Cross Ref D-optimal statistical designs with restricted string property27 June 2007 | Communications in Statistics - Theory and Methods, Vol. 14, No. 3 Cross Ref Circular representation problem on hypergraphsDiscrete Mathematics, Vol. 51, No. 3 Cross Ref Optimal weighing designs with a string propertyJournal of Statistical Planning and Inference, Vol. 8, No. 3 Cross Ref Properties of (0, 1)-matrices without certain configurationsJournal of Combinatorial Theory, Series A, Vol. 31, No. 3 Cross Ref Properties of (0, 1)-matrices with no trianglesJournal of Combinatorial Theory, Series A, Vol. 29, No. 2 Cross Ref Interval Graphs Cross Ref Properties of (0,1)-Matrices With Forbidden Configurations Cross Ref Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, Vol. 13, No. 3 Cross Ref Information storage and retrieval — mathematical foundations II (combinatorial problems)Theoretical Computer Science, Vol. 3, No. 2 Cross Ref Intersection properties of finite setsJournal of Combinatorial Theory, Series A, Vol. 14, No. 1 Cross Ref A structure theorem for the consecutive 1's propertyJournal of Combinatorial Theory, Series B, Vol. 12, No. 2 Cross Ref A fundamental matrix equation for finite sets1 January 1972 | Proceedings of the American Mathematical Society, Vol. 34, No. 2 Cross Ref Volume 17, Issue 3| 1969SIAM Journal on Applied Mathematics History Submitted:03 December 1967Published online:12 July 2006 InformationCopyright © 1969 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0117056Article page range:pp. 593-602ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics