The following pages link to Hans Jürgen Prömel (Q171728):
Displaying 50 items.
- (Q161171) (redirect page) (← links)
- (Q686270) (redirect page) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- Canonical partition theorems for parameter sets (Q798658) (← links)
- A short proof of the restricted Ramsey theorem for finite set systems (Q909675) (← links)
- (Q1050981) (redirect page) (← links)
- A canonical partition theorem for equivalence relations on \(Z^ n\). (Q1050982) (← links)
- Canonizing Ramsey theorems for finite graphs and hypergraphs (Q1061749) (← links)
- On the sum of the reciprocals of cycle lengths in sparse graphs (Q1068848) (← links)
- Canonizing ordering theorems for Hales Jewett structures (Q1068858) (← links)
- An elementary proof of the canonizing version of Gallai-Witt's theorem (Q1073794) (← links)
- Partition properties of q-hypergraphs (Q1076044) (← links)
- Hereditary attributes of surjections and parameter sets (Q1084394) (← links)
- Counting unlabeled structures (Q1089001) (← links)
- A canonical restricted version of van der Waerden's theorem (Q1093636) (← links)
- Induced partition properties of combinatorial cubes (Q1099180) (← links)
- Canonical forms of Borel-measurable mappings \(\Delta: [\omega]^{\omega}\to {\mathbb{R}}\) (Q1102966) (← links)
- Some remarks on natural orders for combinatorial cubes (Q1116962) (← links)
- Partition theorems for parameter systems and graphs (Q1153166) (← links)
- Recent results in partition (Ramsey) theory for finite lattices (Q1153914) (← links)
- Routing in VLSI-layout (Q1179413) (← links)
- Graham-Rothschild parameter words and measurable partitions (Q1180427) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- From wqo to bqo, via Ellentuck's theorem (Q1201238) (← links)
- The asymptotic number of graphs not containing a fixed color-critical subgraph (Q1204522) (← links)
- Induced Ramsey numbers (Q1288912) (← links)
- Forbidden induced partial orders (Q1301728) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- On random planar graphs, the number of planar graphs and their triangulations (Q1405106) (← links)
- Independent Deuber sets in graphs on the natural numbers (Q1406743) (← links)
- Obituary: Walter Deuber (1942-1999) (Q1582476) (← links)
- On the evolution of the worst-case OBDD size (Q1607073) (← links)
- Non-Ramsey graphs are \(c\log n\)-universal (Q1818220) (← links)
- A note on triangle-free and bipartite graphs (Q1850031) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- Large numbers, Knuth's arrow notation, and Ramsey theory (Q1868161) (← links)
- Ordered binary decision diagrams and the Shannon effect (Q1878402) (← links)
- For which densities are random triangle-free graphs almost surely bipartite? (Q1878594) (← links)
- The average number of linear extensions of a partial order (Q1906134) (← links)
- Counting \(H\)-free graphs (Q1918567) (← links)
- \(K_4\)-free subgraphs of random graphs revisited (Q2460631) (← links)
- Counting Partial Orders with a Fixed Number of Comparable Pairs (Q2726711) (← links)
- Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
- On the structure of clique-free graphs (Q2748425) (← links)
- (Q3210200) (← links)
- (Q3329479) (← links)
- (Q3358755) (← links)
- (Q3669425) (← links)
- (Q3671222) (← links)
- (Q3671226) (← links)
