Prömel, Hans-Jürgen (1953- )
Prömel, Hans Jürgen.
Prömel, H. J.
Hans Jürgen Prömel mathématicien allemand
Hans Jürgen Prömel
Prömel, H.J. (Hans Jürgen)
VIAF ID: 5086044 ( Personal )
Permalink: http://viaf.org/viaf/5086044
Preferred Forms
- 100 0 _ ‡a Hans Jürgen Prömel
- 100 0 _ ‡a Hans Jürgen Prömel ‡c mathématicien allemand
- 200 _ | ‡a Prömel ‡b Hans Jürgen
-
- 100 1 0 ‡a Prömel, H. J.
-
-
- 100 1 _ ‡a Prömel, Hans Jürgen
- 100 1 _ ‡a Prömel, Hans Jürgen ‡d 1953-
- 100 1 _ ‡a Prömel, H. J.
-
-
-
-
-
4xx's: Alternate Name Forms (26)
5xx's: Related Names (3)
- 551 _ _ ‡a Bienen, Nordrhein-Westfalen ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 551 _ _ ‡a Darmstadt ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 510 2 _ ‡a Technische Universität Darmstadt ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
450 Jahre Wissen - Sammeln - Vermitteln. Von der Hof- zur Universitäts- und Landesbibliothek Darmstadt : 1567-2017 | |
Almost all Berge graphs are perfect | |
Almost bipartite making graphs | |
Aspects of Ramsey theory | |
Asymptotic enumeration of l-colorable graphs | |
asymptotic number of graphs not containing a fixed color-critical subgraph | |
Counting h-free graphs | |
Counting unlabeled structures | |
Excluding induced subgraphs III: a general asymptotic | |
Fast growing functions based on Ramsey theorems | |
Flüsse in Netzwerken e. Überblick | |
From WQO to BQO, via Ellentuck's theorem | |
Graham-Rotschild parameter words and measurable partitions | |
Induzierte Partitionssätze | |
[Kl-free] graphs: asymptotic structure and A 0-1 law | |
Lectures on proof verification and approximation algorithms, c1998: | |
Partition properties of q-hypergraphs | |
partition theorem for [0,1] | |
Partitioning graphs into dense subgraphs | |
Probabilistische Argumente und algorithmische Probleme in der diskreten Mathematik | |
Ramsey theorems for finite graphs | |
Ramsey Theory for Discrete Structures | |
Some remarks on natural orders for combinatorial cubes | |
sparse Gallai-Witt theorem | |
Steiner tree problem a tour through graphs, algorithms, and complexity | |
Steiner trees in VLSI layout | |
Trends in discrete mathematics, 1995: | |
Vorlesung über das Steiner-Problem in Graphen |