scientific article; zbMATH DE number 3216216
From MaRDI portal
Publication:5343356
zbMath0133.26003MaRDI QIDQ5343356
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Determinants, permanents, traces, other special matrix functions (15A15) Random matrices (algebraic aspects) (15B52)
Related Items
Colorful Hamilton Cycles in Random Graphs, Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs, Lipschitz bijections between boolean functions, Asymptotic existence of proportionally fair allocations, Perfect fractional matchings in \(k\)-out hypergraphs, On the Pólya permanent problem over finite fields, Perfect matchings in inhomogeneous random bipartite graphs in random environment, Perfect matchings in random subgraphs of regular bipartite graphs, Cycle lengths in randomly perturbed graphs, Fixing knockout tournaments with seeds, Bipartite perfect matching as a real polynomial, Matchings in random regular bipartite digraphs, Small maximal matchings in random graphs., Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Threshold for Steiner triple systems, Extrema of a multinomial assignment process, Two problems on independent sets in graphs, When Do Envy-Free Allocations Exist?, Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs, The threshold for the full perfect matching color profile in a random coloring of random graphs, Matchings and cycle covers in random digraphs, Matching theory -- a sampler: From Dénes König to the present, Matching and covering the vertices of a random graph by copies of a given graph, Random edge domination, Broadcasting in random graphs, On the Encoding of Relations by Graphs, The normalized matching property in random and pseudorandom bipartite graphs, Closing Gaps in Asymptotic Fair Division, Hamiltonicity in random directed graphs is born resilient, Design and analysis of multi-hospital kidney exchange mechanisms using random graphs, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
