Interview with Douglas West
From MaRDI portal
Publication:6659965
DOI10.54550/ECA2023V3S3I8MaRDI QIDQ6659965FDOQ6659965
Authors: Toufik Mansour 
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Mr. Paint and Mrs. Correct
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- On chromatic‐choosable graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Bounds for sorting by prefix reversal
- Should Tables Be Sorted?
- Improved bounds and algorithms for hypergraph 2-coloring
- On-line list colouring of graphs
- A symmetric chain decomposition of L(4,n)
- Cycles in color-critical graphs
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- On double and multiple interval graphs
- A proof of a conjecture of Ohba
- Kleitman and combinatorics: A celebration
- Maximum antichains of rectangular arrays
- Some basic observations on Kelly's conjecture for graphs
- Extremal values of the interval number of a graph. II
- The Bar Visibility Number of a Graph
- Chip games and paintability
- A class of solutions to the gossip problem. III
- Skew chain orders and sets of rectangles
- Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
- On the bar visibility number of complete bipartite graphs
This page was built for publication: Interview with Douglas West
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659965)
