The following pages link to David B. Penman (Q590772):
Displaying 50 items.
- Pattern avoidance in poset permutations (Q304187) (← links)
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices (Q334974) (← links)
- Geometric preferential attachment in non-uniform metric spaces (Q388843) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- A structure theorem for Boolean functions with small total influences (Q447936) (← links)
- Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces (Q471395) (← links)
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs (Q483318) (← links)
- On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth (Q488867) (← links)
- Wired cycle-breaking dynamics for uniform spanning forests (Q504250) (← links)
- Online vertex-coloring games in random graphs (Q532126) (← links)
- Random walks and diffusions on graphs and databases. An introduction. (Q633358) (← links)
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents (Q633812) (← links)
- Random partial orders defined by angular domains (Q634753) (← links)
- On the independence number and Hamiltonicity of uniform random intersection graphs (Q650910) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs (Q681525) (← links)
- (Q705748) (redirect page) (← links)
- High connectivity keeping sets in \(n\)-connected graphs (Q705749) (← links)
- Local convergence of random graph colorings (Q722328) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- Forbidden configurations for distributive, modular and semidistributive posets (Q738856) (← links)
- Nonuniform recursive trees with vertex attraction depending on their labels (Q782798) (← links)
- Vertices with fixed outdegrees in large Galton-Watson trees (Q782806) (← links)
- (Q817759) (redirect page) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- Small subsets inherit sparse \(\varepsilon\)-regularity (Q858679) (← links)
- Limits of dense graph sequences (Q859618) (← links)
- Asymptotic normality of the \(k\)-core in random graphs (Q930680) (← links)
- Handbook of large-scale random networks (Q938590) (← links)
- Noisy random graphs and their laplacians (Q941350) (← links)
- How to avoid using the regularity Lemma: Pósa's conjecture revisited (Q960978) (← links)
- Gibbs measures and phase transitions on sparse random graphs (Q985984) (← links)
- Large components in random induced subgraphs of \(n\)-cubes (Q1025930) (← links)
- A note on the chromatic number of a dense random graph (Q1025972) (← links)
- Random even graphs (Q1028823) (← links)
- Large deviations in randomly coloured random graphs (Q1038966) (← links)
- Random regular graphs of non-constant degree: concentration of the chromatic number (Q1043588) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- (Q1612299) (redirect page) (← links)
- The phase transition in a random hypergraph (Q1612300) (← links)
- Random matrices have simple spectrum (Q1677622) (← links)
- A proof of the block model threshold conjecture (Q1715062) (← links)
- Additively weighted Harary index of some composite graphs (Q1759808) (← links)
- Structure of large random hypergraphs (Q1774214) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- On an extremal problem for poset dimension (Q1789056) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Hamilton cycles in random subgraphs of pseudo-random graphs (Q1849919) (← links)
- Percolation on finite graphs and isoperimetric inequalities. (Q1878979) (← links)
- The diameter of a scale-free random graph (Q1882139) (← links)
