The following pages link to Pat Devlin (Q1621422):
Displaying 14 items.
- Proof of an entropy conjecture of Leighton and Moitra (Q1621423) (← links)
- A stability result using the matrix norm to bound the permanent (Q1650024) (← links)
- Two-vertex generators of Jacobians of graphs (Q1700775) (← links)
- Perfect fractional matchings in \(k\)-out hypergraphs (Q2409824) (← links)
- Central limit theorem for majority dynamics: bribing three voters suffices (Q2668498) (← links)
- On “stability” in the Erdös--Ko--Rado Theorem (Q2813346) (← links)
- Maximum distances in the four-digit Kaprekar process (Q3390073) (← links)
- Hamiltonian Berge cycles in random hypergraphs (Q4993259) (← links)
- Palindromes in finite groups and the Explorer-Director game (Q4994452) (← links)
- The explorer-director game on graphs (Q6041379) (← links)
- Perfect matchings and derangements on graphs (Q6055945) (← links)
- Combinatorial games played randomly: Chomp and nim (Q6519471) (← links)
- Diametric problem for permutations with the Ulam metric (optimal anticodes) (Q6524558) (← links)
- Evolution of locally dependent random graphs (Q6728895) (← links)
