Pages that link to "Item:Q5906245"
From MaRDI portal
The following pages link to Asymptotic enumeration of Latin rectangles (Q5906245):
Displayed 16 items.
- Divisors of the number of Latin rectangles (Q966063) (← links)
- The number of matchings in random regular graphs and bipartite graphs (Q1081621) (← links)
- The combinatorics behind number-theoretic sieves (Q1272794) (← links)
- Most Latin squares have many subsquares (Q1291124) (← links)
- The Holens-Đoković conjecture on permanents fails! (Q1301285) (← links)
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum (Q1301841) (← links)
- Mappings of Latin squares (Q1362666) (← links)
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). (Q1414135) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- Sieve methods in combinatorics (Q2484504) (← links)
- Effective scalar products of D-finite symmetric functions (Q2568968) (← links)
- Counting Matchings and Tree-Like Walks in Regular Graphs (Q3058300) (← links)
- On Minc's sixth Conjecture (Q3422759) (← links)
- The cycle structure of two rows in a random Latin square (Q3608297) (← links)
- Permanents, matchings and Latin rectangles (Q4243364) (← links)
- Random strongly regular graphs? (Q5907044) (← links)