Perfect Matchings in Random r-regular, s-uniform Hypergraphs
From MaRDI portal
Publication:4883058
Recommendations
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A threshold for perfect matchings in random d-pure hypergraphs
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Matching and covering the vertices of a random graph by copies of a given graph
- On the existence of a factor of degree one of a connected random graph
- Perfect matchings in random s‐uniform hypergraphs
- The asymptotic number of labeled graphs with given degree sequences
- Tree-Matchings in Graph Processes
Cited in
(34)- The cover times of random walks on random uniform hypergraphs
- Randomized algorithms to generate hypergraphs with given degree sequences
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Perfect matchings in random uniform hypergraphs
- Isomorphism for random \(k\)-uniform hypergraphs
- Spanning trees in random regular uniform hypergraphs
- SIS epidemic propagation on hypergraphs
- Inapproximability of counting hypergraph colourings
- Perfect matchings via uniform sampling in regular bipartite graphs
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- The degree-restricted random process is far from uniform
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees
- Satisfiability thresholds for regular occupation problems
- Cores in random hypergraphs and Boolean formulas
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
- Increasing the flexibility of the herding attack
- Hitting times for Shamir's problem
- Pseudorandom hypergraph matchings
- scientific article; zbMATH DE number 949656 (Why is no real title available?)
- On regular hypergraphs of high girth
- Satisfiability thresholds for regular occupation problems
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
- Rainbow Hamilton cycles in random regular graphs
- Graph factors and factorization: 1985--2003: a survey
- Perfect fractional matchings in \(k\)-out hypergraphs
- Identifying defective sets using queries of small size
- Factors in random graphs
- Asymptotics for Shamir's problem
- The matching process and independent process in random regular graphs and hypergraphs
- Modulo k-orientations of random regular graphs
- Approximate counting of regular hypergraphs
- Sampling hypergraphs with given degrees
- Smart elements in combinatorial group testing problems with more defectives
This page was built for publication: Perfect Matchings in Random r-regular, s-uniform Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883058)
