Pages that link to "Item:Q4883058"

The following pages link to Perfect Matchings in Random <i>r</i>-regular, <i>s</i>-uniform Hypergraphs (Q4883058):

Displaying 25 items.

• SIS epidemic propagation on hypergraphs (Q301557) (← links)
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
• The cover times of random walks on random uniform hypergraphs (Q392193) (← links)
• On regular hypergraphs of high girth (Q405152) (← links)
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees (Q499481) (← links)
• Increasing the flexibility of the herding attack (Q763502) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626) (← links)
• Sampling hypergraphs with given degrees (Q1981695) (← links)
• A threshold result for loose Hamiltonicity in random regular uniform hypergraphs (Q1985454) (← links)
• The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
• Isomorphism for random \(k\)-uniform hypergraphs (Q2224850) (← links)
• Perfect fractional matchings in \(k\)-out hypergraphs (Q2409824) (← links)
• Identifying defective sets using queries of small size (Q2411609) (← links)
• Approximate counting of regular hypergraphs (Q2445249) (← links)
• Asymptotics for Shamir's problem (Q2700633) (← links)
• Rainbow Hamilton cycles in random regular graphs (Q3419610) (← links)
• Factors in random graphs (Q3522827) (← links)
• Pseudorandom hypergraph matchings (Q4993112) (← links)
• Hitting times for Shamir’s problem (Q5020682) (← links)
• (Q5091251) (← links)
• Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
• Cores in random hypergraphs and Boolean formulas (Q5311914) (← links)
• Asymptotic Enumeration of Hypergraphs by Degree Sequence (Q5871279) (← links)
• Spanning trees in random regular uniform hypergraphs (Q5886306) (← links)