The following pages link to Steve Butler (Q244836):
Displaying 50 items.
- The enhanced principal rank characteristic sequence (Q269271) (← links)
- A cospectral family of graphs for the normalized Laplacian found by toggling (Q306482) (← links)
- Counting prime juggling patterns (Q343702) (← links)
- Rainbow arithmetic progressions (Q344442) (← links)
- The principal rank characteristic sequence over various fields (Q401187) (← links)
- Tiling a strip with triangles (Q405071) (← links)
- Computing inertia sets using atoms (Q417545) (← links)
- Edge flipping in the complete graph (Q492703) (← links)
- Hypercube orientations with only two in-degrees (Q543901) (← links)
- Shuffling with ordered cards (Q543988) (← links)
- Irreducible Apollonian configurations and packings (Q603845) (← links)
- Tiling polygons with lattice triangles (Q603872) (← links)
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
- Enumerating (Multiplex) juggling sequences (Q659814) (← links)
- A construction of cospectral graphs for the normalized Laplacian (Q665752) (← links)
- A note on marking lines in \([k]^n\) (Q690664) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- Using discrepancy to control singular values for nonnegative matrices (Q865410) (← links)
- How to play the majority game with a liar (Q960976) (← links)
- A forest building process on simple graphs (Q1686006) (← links)
- Permutations resilient to deletions (Q1710995) (← links)
- Enumerating parking completions using join and split (Q2188834) (← links)
- The passing of Ron Graham (Q2210588) (← links)
- Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
- Correction to: ``Properties of a \(q\)-analogue of zero forcing'' (Q2227981) (← links)
- Graph switching, 2-ranks, and graphical Hadamard matrices (Q2317657) (← links)
- Knight's tours on boards with odd dimensions (Q2352923) (← links)
- Parking distributions on trees (Q2400978) (← links)
- Juggling card sequences (Q2404825) (← links)
- On the genus of a quotient of a numerical semigroup (Q2416395) (← links)
- Graphs with at most two trees in a forest-building process (Q2424270) (← links)
- Forest-like permutations (Q2427010) (← links)
- An interstice relationship for flowers with four petals (Q2441408) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- Spectral properties of the exponential distance matrix (Q2692977) (← links)
- Subdivision Using Angle Bisectors Is Dense in the Space of Triangles (Q2856461) (← links)
- Throttling zero forcing propagation speed on graphs (Q2866604) (← links)
- Optimal jumping patterns (Q2880101) (← links)
- Finding Patterns Avoiding Many Monochromatic Constellations (Q2911514) (← links)
- Numerical Tic-Tac-Toe on the 4×4 Board (Q2920490) (← links)
- Unrolling Residues to Avoid Progressions (Q2929448) (← links)
- Algebraic aspects of the normalized Laplacian (Q2957185) (← links)
- (Q3060856) (← links)
- (Q3068986) (← links)
- Enumerating multiplex juggling patterns (Q3120411) (← links)
- Using variants of zero forcing to bound the inertia set of a graph (Q3448171) (← links)
- (Q3449943) (← links)
- CONSTRUCTING POINTS THROUGH FOLDING AND INTERSECTION (Q3459361) (← links)
- Egyptian fractions with each denominator having three distinct prime divisors (Q3462505) (← links)
- Interlacing for weighted graphs using the normalized Laplacian (Q3497874) (← links)
