The following pages link to David B. Penman (Q590772):
Displaying 34 items.
- Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees (Q2405112) (← links)
- List supermodular coloring (Q2419323) (← links)
- Poset limits and exchangeable random posets (Q2428630) (← links)
- Perfect matchings in random intersection graphs (Q2434152) (← links)
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- Periodic Schur process and cylindric partitions (Q2463354) (← links)
- Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) (Q2498001) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Boolean dimension and tree-width (Q2658384) (← links)
- Constrained minimum passage time in random geometric graphs (Q2659771) (← links)
- Linear extension numbers of \(n\)-element posets (Q2663168) (← links)
- Characterization of 4-critical triangle-free toroidal graphs (Q2668022) (← links)
- On a question of Vera T. Sós about size forcing of graphons (Q2678384) (← links)
- Multitrees in random graphs (Q2684902) (← links)
- Isomorphisms between random graphs (Q2692783) (← links)
- Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups (Q2921810) (← links)
- DUAL PIVOT QUICKSORT (Q3166751) (← links)
- (Q4416748) (← links)
- (Q4453445) (← links)
- (Q5402434) (← links)
- Bipartite Kneser graphs are Hamiltonian (Q5895045) (← links)
- Hamilton cycles in random lifts of graphs (Q5898131) (← links)
- Mutually orthogonal Latin squares as group transversals (Q6043884) (← links)
- A large-deviations principle for all the components in a sparse inhomogeneous random graph (Q6045832) (← links)
- Minimum degree stability of \(H\)-free graphs (Q6057487) (← links)
- Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime (Q6080191) (← links)
- An improved bound for the linear arboricity conjecture (Q6081382) (← links)
- Prague dimension of random graphs (Q6081403) (← links)
- A recursive theta body for hypergraphs (Q6081405) (← links)
- Results about the total chromatic number and the conformability of some families of circulant graphs (Q6094719) (← links)
- Constructions for new orthogonal arrays based on large sets of orthogonal arrays (Q6101283) (← links)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
- Scale-free percolation mixing time (Q6145597) (← links)
- Recent progress towards Hadwiger's conjecture (Q6198638) (← links)
