The following pages link to (Q3154668):
Displaying 17 items.
- Perfect matchings in random polyomino chain graphs (Q282170) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- Tight multiple twins in permutations (Q825967) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- A scaling limit for the length of the longest cycle in a sparse random graph (Q1998764) (← links)
- Variations on twins in permutations (Q2048547) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← links)
- The average number of spanning trees in sparse graphs with given degrees (Q2357218) (← links)
- (Q3390429) (← links)
- Perfect matchings in random bipartite graphs with minimal degree at least 2 (Q4680412) (← links)
- (Q5136324) (← links)
- Exact matching of random graphs with constant correlation (Q6041769) (← links)
- Finding maximum matchings in random regular graphs in linear expected time (Q6049997) (← links)
- (Q6072063) (← links)
- A scaling limit for the length of the longest cycle in a sparse random digraph (Q6074672) (← links)
- The number of perfect matchings, and the nesting properties, of random regular graphs (Q6076217) (← links)
