The following pages link to David B. Penman (Q590772):
Displaying 50 items.
- Bipartite subgraphs and quasi-randomness (Q1889833) (← links)
- Distance-2-matchings of random graphs (Q1889893) (← links)
- Fixed point polynomials of permutation groups. (Q1953509) (← links)
- Compact graphings (Q2003771) (← links)
- Progress in high-dimensional percolation and random graphs (Q2012668) (← links)
- Rainbow \(k\)-connectivity of random bipartite graphs (Q2025233) (← links)
- On some 2-edge-connected homogenous graphs and Cayley graphs with two removable vertices (Q2036576) (← links)
- Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets (Q2036599) (← links)
- Tournament quasirandomness from local counting (Q2036620) (← links)
- A finitary structure theorem for vertex-transitive graphs of polynomial growth (Q2036622) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- \(2\)-distance coloring of planar graphs with maximum degree \(5\) (Q2075520) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- The Fréchet mean of inhomogeneous random graphs (Q2086589) (← links)
- The geometric reason for the non-existence of a MOL(6) (Q2094259) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Injective edge chromatic index of generalized Petersen graphs (Q2105277) (← links)
- Universality of cutoff for graphs with an added random matching (Q2119210) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs (Q2142635) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Completing partial Latin squares with two filled rows and three filled columns (Q2167566) (← links)
- Betti numbers and anti-lecture Hall compositions of random threshold graphs (Q2171873) (← links)
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges (Q2214056) (← links)
- Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
- Random bipartite posets and extremal problems (Q2220979) (← links)
- Expander graphs -- both local and global (Q2226628) (← links)
- Spectral radii of sparse random matrices (Q2227480) (← links)
- Explicit expanders of every degree and size (Q2236654) (← links)
- On the chromatic numbers of random hypergraphs (Q2243791) (← links)
- Limits of random trees (Q2250844) (← links)
- Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\) (Q2254100) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- The circular law for random regular digraphs (Q2291966) (← links)
- Characterizing subclasses of cover-incomparability graphs by forbidden subposets (Q2314427) (← links)
- The sub-exponential transition for the chromatic generalized Ramsey numbers (Q2322506) (← links)
- Density of monochromatic infinite subgraphs (Q2338615) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Limits of random trees. II (Q2341945) (← links)
- Permutation statistics and multiple pattern avoidance (Q2345777) (← links)
- Scaling limits of random planar maps with a unique large face (Q2352748) (← links)
- Random subgraphs of the 2D Hamming graph: The supercritical phase (Q2380761) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Planar zero divisor graphs of partially ordered sets (Q2392025) (← links)
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields (Q2398955) (← links)
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015 (Q2399894) (← links)
- Tree-width and dimension (Q2400108) (← links)
