The following pages link to Alexander D. Scott (Q846045):
Displaying 50 items.
- Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures (Q256991) (← links)
- Disjoint dijoins (Q290802) (← links)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- The complexity of free-flood-it on \(2\times n\) boards (Q388453) (← links)
- Excluding pairs of graphs (Q402589) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- The complexity of flood-filling games on graphs (Q423894) (← links)
- On Ryser's conjecture (Q426782) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- Intersections of hypergraphs (Q473105) (← links)
- Disjoint paths in tournaments (Q481696) (← links)
- Complete monotonicity for inverse powers of some combinatorially defined polynomials (Q483372) (← links)
- Spanning trees and the complexity of flood-filling games (Q489766) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- (Q591728) (redirect page) (← links)
- The minimal covering set in large tournaments (Q656810) (← links)
- Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes (Q723885) (← links)
- Random graphs from a block-stable class (Q739054) (← links)
- Some variants of the exponential formula, with application to the multivariate Tutte polynomial (alias Potts model) (Q846046) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Uniform multicommodity flow through the complete graph with random edge-capacities (Q1038093) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
- Reconstructing subsets of reals (Q1283873) (← links)
- Another simple proof of a theorem of Milner (Q1304631) (← links)
- Induced cycles and chromatic number (Q1306304) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- Independent sets and repeated degrees (Q1363652) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- Reconstructing sequences (Q1377760) (← links)
- On graph decompositions modulo \(k\) (Q1377772) (← links)
- Subdivisions of transitive tournaments (Q1590220) (← links)
- Induced subgraphs of graphs with large chromatic number. XI. Orientations (Q1633601) (← links)
- How unproportional must a graph be? (Q1663804) (← links)
- Stability results for graphs with a critical edge (Q1671746) (← links)
- Supersaturation in posets and applications involving the container method (Q1679331) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Disjoint paths in unions of tournaments (Q1719586) (← links)
- Alternating knot diagrams, Euler circuits and the interlace polynomial (Q1840823) (← links)
- A note on cycle lengths in graphs (Q1865137) (← links)
- Every tree contains a large induced subgraph with all degrees odd (Q1893180) (← links)
- A proof of a conjecture of Bondy concerning paths in weighted digraphs (Q1924127) (← links)
