On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
From MaRDI portal
Publication:1587507
zbMath0964.05053MaRDI QIDQ1587507
Publication date: 30 November 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121049
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Strong edge colorings of uniform graphs, The local limit of the uniform spanning tree on dense graphs, Hamiltonicity in prime sum graphs, Embedding cycles in finite planes, The number of Hamiltonian decompositions of regular graphs, Computing and counting longest paths on circular-arc graphs in polynomial time, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
