• Publications
  • Influence
On induced matchings
  • A. Steger, M. Yu
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 September 1993
TLDR
An affirmative answer is given for d=3, the first nontrivial case of this conjecture that q ∗ (G)⩽d 2 , if G is a bipartite graph and d is the maximum degree of G. Expand
"Balls into Bins" - A Simple and Tight Analysis
TLDR
Borders for all values of m(n) ≥ n=polylog( n) are proved by using the simple and well-known method of the first and second moment. Expand
Generating Random Regular Graphs Quickly
TLDR
A practical algorithm for generating random regular graphs for all d growing as a small power of n, in the sense that all d-regular graphs on n vertices have in the limit the same probability as n → ∞. Expand
Balanced allocations: the heavily loaded case
TLDR
It is shown that the multiplechoice processes are fundamentally different from the singlechoice variant in that they have "short memory" and the deviation of the multiple-choice processes from the optimal allocation does not increase with the number of balls as in case of the single-choice process. Expand
Random planar graphs
TLDR
It is shown that the probability that Rn is connected is bounded away from 0 and from 1, and that each positive integer k, with high probability Rn has linearly many vertices of a given degree. Expand
The asymptotic number of graphs not containing a fixed color-critical subgraph
TLDR
The class of those graphsH which have the property that almost all graphs inForb(H) are ℓ-colorable are characterized, and it is shown that this class corresponds exactly to the class of graphs whose extremal graph is the Turán-graphTn(ℓ). Expand
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
TLDR
This approach gives rise to conceptually much easier and faster (though randomized) sequential approximation algorithms for the Steiner tree problem than the currently best known algorithms from Karpinski and Zelikovsky which almost match their approximation factor. Expand
Excluding Induced Subgraphs III: A General Asymptotic
In this article we study asymptotic properties of the class of graphs not containing a fixed graph H as an induced subgraph. In particular we show that the number Forbn★(H) of such graphs on nExpand
Excluding Induced Subgraphs: Quadrilaterals
TLDR
It turns out that there are asymptotically twice as many graphs not containing an induced quadrilateral than there are bipartite graphs. Expand
...
1
2
3
4
5
...