Hans Jürgen Prömel

From MaRDI portal
Person:171728

Available identifiers

zbMath Open promel.hans-jurgenWikidataQ1580625 ScholiaQ1580625MaRDI QIDQ171728

List of research outcomes

PublicationDate of PublicationType
RNC-approximation algorithms for the steiner problem2022-11-09Paper
Ramsey Theory for Discrete Structures2014-02-05Paper
\(K_4\)-free subgraphs of random graphs revisited2007-11-12Paper
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber2005-04-04Paper
For which densities are random triangle-free graphs almost surely bipartite?2004-09-07Paper
Ordered binary decision diagrams and the Shannon effect2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44487612004-02-18Paper
Independent Deuber sets in graphs on the natural numbers2003-09-07Paper
On random planar graphs, the number of planar graphs and their triangulations2003-08-25Paper
Large numbers, Knuth's arrow notation, and Ramsey theory2003-04-27Paper
Steiner trees in uniformly quasi-bipartite graphs.2003-01-21Paper
A note on triangle-free and bipartite graphs2002-12-02Paper
Almost all graphs with high girth and suitable density have high chromatic number2002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q45421802002-08-04Paper
On the evolution of the worst-case OBDD size2002-07-25Paper
Phase transitions in the evolution of partial orders2002-06-02Paper
A dual form of Erdős-Rado's canonization theorem2001-11-06Paper
Canonical forms of Borel-measurable mappings \(\Delta: [\omega^\omega\to R\)]2001-11-06Paper
Aspects of asymptotic graph theory2001-11-06Paper
On the structure of clique-free graphs2001-10-14Paper
Asymptotic enumeration, global structure, and constrained evolution2001-07-24Paper
Counting Partial Orders with a Fixed Number of Comparable Pairs2001-07-18Paper
Independent arithmetic progressions in clique-free graphs on the natural numbers2001-04-17Paper
Obituary: Walter Deuber (1942-1999)2001-03-20Paper
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/32000-08-27Paper
Non-Ramsey graphs are \(c\log n\)-universal2000-04-09Paper
Forbidden induced partial orders1999-12-12Paper
https://portal.mardi4nfdi.de/entity/Q42523191999-06-17Paper
Induced Ramsey numbers1999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q43479031997-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43082801997-06-04Paper
https://portal.mardi4nfdi.de/entity/Q47182351997-01-29Paper
https://portal.mardi4nfdi.de/entity/Q56890371997-01-23Paper
Counting \(H\)-free graphs1996-07-18Paper
https://portal.mardi4nfdi.de/entity/Q42738431996-05-30Paper
The average number of linear extensions of a partial order1996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q48655221996-02-25Paper
Probabilistically checkable proofs and their consequences for approximation algorithms1995-11-06Paper
Random I‐colorable graphs1995-02-09Paper
Almost all Berge Graphs are Perfect1994-05-30Paper
Extremal Graph Problems for Graphs with a Color-Critical Vertex1994-04-28Paper
Excluding induced subgraphs. II: Extremal graphs1993-11-30Paper
The asymptotic number of graphs not containing a fixed color-critical subgraph1993-03-10Paper
From wqo to bqo, via Ellentuck's theorem1993-01-17Paper
Coloring Clique-free Graphs in Linear Expected Time1993-01-16Paper
Fast growing functions based on Ramsey theorems1992-09-27Paper
Excluding Induced Subgraphs III: A General Asymptotic1992-06-28Paper
Graham-Rothschild parameter words and measurable partitions1992-06-27Paper
Routing in VLSI-layout1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39727551992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39704961992-06-25Paper
Excluding induced subgraphs: quadrilaterals1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39720221992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q32102001990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33587551990-01-01Paper
A Partition Theorem for [ 0, 1 ]1990-01-01Paper
A short proof of the restricted Ramsey theorem for finite set systems1989-01-01Paper
Some remarks on natural orders for combinatorial cubes1989-01-01Paper
A Sparse Graham-Rothschild Theorem1988-01-01Paper
Counting unlabeled structures1987-01-01Paper
A canonical restricted version of van der Waerden's theorem1987-01-01Paper
K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law1987-01-01Paper
An elementary proof of the canonizing version of Gallai-Witt's theorem1986-01-01Paper
Partition properties of q-hypergraphs1986-01-01Paper
Hereditary attributes of surjections and parameter sets1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36970511986-01-01Paper
A dual form of Erdős-Rado's canonization theorem1986-01-01Paper
Canonizing Ramsey theorems for finite graphs and hypergraphs1985-01-01Paper
On the sum of the reciprocals of cycle lengths in sparse graphs1985-01-01Paper
Canonizing ordering theorems for Hales Jewett structures1985-01-01Paper
Induced partition properties of combinatorial cubes1985-01-01Paper
Canonical forms of Borel-measurable mappings \(\Delta: [\omega^{\omega}\to {\mathbb{R}}\)]1985-01-01Paper
Baire Sets of k-Parameter Words are Ramsey1985-01-01Paper
Asymptotic enumeration and a 0-1 law for $m$-clique free graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37641551984-01-01Paper
Canonical partition theorems for parameter sets1983-01-01Paper
A canonical partition theorem for equivalence relations on \(Z^ n\).1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33294791983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36694251982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36712221982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36712261982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47405841982-01-01Paper
Partition theorems for parameter systems and graphs1981-01-01Paper
Recent results in partition (Ramsey) theory for finite lattices1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822181979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hans Jürgen Prömel