scientific article; zbMATH DE number 3801730
From MaRDI portal
Publication:4745951
zbMATH Open0508.15004MaRDI QIDQ4745951FDOQ4745951
Authors: G. P. Egorychev
Publication date: 1981
Title of this publication is not available (Why is that?)
Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15) Orthogonal arrays, Latin squares, Room squares (05B15) Stochastic matrices (15B51)
Cited In (12)
- Improved upper bounds on even-cycle creating Hamilton paths
- Number of 1-factorizations of regular high-degree graphs
- Some results towards the Dittert conjecture on permanents
- Approximate Hamilton decompositions of random graphs
- Randomly colouring graphs (a combinatorial view)
- Matching theory -- a sampler: From Dénes König to the present
- Enumerating coprime permutations
- Edge-disjoint Hamilton cycles in random graphs
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Extremal positive semidefinite doubly stochastic matrices
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- The minimum number of spanning trees in regular multigraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745951)