The following pages link to Stephen J. Young (Q304174):
Displaying 21 items.
- Posets with cover graph of pathwidth two have bounded dimension (Q304175) (← links)
- On the Stanley depth of squarefree Veronese ideals (Q626443) (← links)
- When linear and weak discrepancy are equal (Q626763) (← links)
- The spectra of multiplicative attribute graphs (Q741499) (← links)
- Connectivity and giant component of stochastic Kronecker graphs (Q890583) (← links)
- Interval partitions and Stanley depth (Q965226) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- Dimension of restricted classes of interval orders (Q2163840) (← links)
- Hereditary semiorders and enumeration of semiorders by dimension (Q2309220) (← links)
- Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\) (Q2401434) (← links)
- A characterization of partially ordered sets with linear discrepancy equal to \(2\) (Q2464732) (← links)
- Stanley depth of squarefree monomial ideals (Q2655040) (← links)
- Planar posets that are accessible from below have dimension at most 6 (Q2663166) (← links)
- Directed Random Dot Product Graphs (Q3078599) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- Towards a Weighted Version of the Hajnal–Szemerédi Theorem (Q4921565) (← links)
- Random Dot Product Graph Models for Social Networks (Q5458306) (← links)
- Dimension of Restricted Classes of Interval Orders (Q6338904) (← links)
- Seven open problems in applied combinatorics (Q6430255) (← links)
- Scalable tensor methods for nonuniform hypergraphs (Q6510856) (← links)
- Scalable tensor methods for nonuniform hypergraphs (Q6583520) (← links)
