2015
Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors.
Integers, 2015
2013
Some of My Favorite Problems and Results.
Proceedings of the Mathematics of Paul Erdős I, 2013
Dense Difference Sets and Their Combinatorial Structure.
Proceedings of the Mathematics of Paul Erdős I, 2013
2006
On some applications of graph theory, I.
Discret. Math., 2006
2003
On large intersecting subfamilies of uniform setfamilies.
Random Struct. Algorithms, 2003
On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discret. Math., 2003
2002
A Ramsey-type problem and the Turán numbers.
J. Graph Theory, 2002
2001
Edge disjoint monochromatic triangles in 2-colored graphs.
Discret. Math., 2001
1999
Finding Large p-Colored Diameter Two Subgraphs.
Graphs Comb., 1999
Ensembles de multiples de suites finies.
Discret. Math., 1999
On the orders of directly indecomposable groups.
Discret. Math., 1999
Subsets of an interval whose product is a power.
Discret. Math., 1999
On arithmetic properties of integers with missing digits II: Prime factors.
Discret. Math., 1999
Greedy algorithm, arithmetic progressions, subset sums and divisibility.
Discret. Math., 1999
Prime power divisors of binomial coefficients.
Discret. Math., 1999
Popular distances in 3-space.
Discret. Math., 1999
On the angular distribution of Gaussian integers with fixed norm.
Discret. Math., 1999
Split and balanced colorings of complete graphs.
Discret. Math., 1999
Induced subgraphs of given sizes.
Discret. Math., 1999
The number of cycle lengths in graphs of given minimum degree and girth.
Discret. Math., 1999
On a question about sum-free sequences.
Discret. Math., 1999
Sur les ensembles représentés par les partitions d'un entier n<sup>1</sup>.
Discret. Math., 1999
Graphs of diameter two with no 4-circuits.
Discret. Math., 1999
Extremal graphs for weights.
Discret. Math., 1999
1998
How to decrease the diameter of triangle-free graphs.
Comb., 1998
Graphs of Extremal Weights.
Ars Comb., 1998
1997
New Ramsey Bounds from Cyclic Graphs of Prime Order.
SIAM J. Discret. Math., 1997
Intersection Statements for Systems of Sets.
J. Comb. Theory, Ser. A, 1997
A Class of Edge Critical 4-Chromatic Graphs.
Graphs Comb., 1997
Covering a graph by complete bipartite graphs.
Discret. Math., 1997
The size of the largest bipartite subgraphs.
Discret. Math., 1997
Distinct distances in finite planar sets.
Discret. Math., 1997
Some old and new problems in various branches of combinatorics.
Discret. Math., 1997
Some recent problems and results in graph theory.
Discret. Math., 1997
Minimum Planar Sets with Maximum Equidistance Counts.
Comput. Geom., 1997
On cycles in the coprime graph of integers.
Electron. J. Comb., 1997
A Variant of the Classical Ramsey Problem.
Comb., 1997
1996
d-complete sequences of integers.
Math. Comput., 1996
Hypercube subgraphs with minimal detours.
J. Graph Theory, 1996
On <i>k</i>-saturated graphs with restrictions on the degrees.
J. Graph Theory, 1996
Proof of a Conjecture of Bollob's on Nested Cycles.
J. Comb. Theory, Ser. B, 1996
Sizes of graphs with induced subgraphs of large maximum degree.
Discret. Math., 1996
Covering and independence in triangle structures.
Discret. Math., 1996
Graphs in which each C<sub>4</sub> spans K<sub>4</sub>.
Discret. Math., 1996
Maximum planar sets that determine k distances.
Discret. Math., 1996
1995
On the Size of a Random Maximal Graph.
Random Struct. Algorithms, 1995
Covering of r-Graphs by Complete r-Partite Subgraphs.
Random Struct. Algorithms, 1995
Extremal Graphs for Intersecting Triangles.
J. Comb. Theory, Ser. B, 1995
On product representations of powers, I.
Eur. J. Comb., 1995
Degree sequence and independence in K(4)-free graphs.
Discret. Math., 1995
Monochromatic and zero-sum sets of nondecreasing diameter.
Discret. Math., 1995
Two Combinatorial Problems in the Plane.
Discret. Comput. Geom., 1995
Intervertex Distances in Convex Polygons.
Discret. Appl. Math., 1995
Multiplicities of Interpoint Distances in Finite Planar Sets.
Discret. Appl. Math., 1995
1994
Change of Leadership in a Random Graph Process.
Random Struct. Algorithms, 1994
Local and global average degree in graphs and multigraphs.
J. Graph Theory, 1994
On additive properties of general sequences.
Discret. Math., 1994
A local density condition for triangles.
Discret. Math., 1994
Extremal problems and generalized degrees.
Discret. Math., 1994
Problems and results in discrete mathematics.
Discret. Math., 1994
A Postscript on Distances in Convex n-Gons.
Discret. Comput. Geom., 1994
Turán-Ramsey Theorems and K<sup>p</sup>-Independence Numbers.
Comb. Probab. Comput., 1994
Independet Transversals in Sparse Partite Hypergraphs.
Comb. Probab. Comput., 1994
1993
Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs.
Eur. J. Comb., 1993
The size Ramsey number of a complete bipartite graph.
Discret. Math., 1993
Monochromatic infinite paths.
Discret. Math., 1993
Clique Partitions of Chordal Graphs.
Comb. Probab. Comput., 1993
Nearly Equal Distances in the Plane.
Comb. Probab. Comput., 1993
Ramsey Size Linear Graphs.
Comb. Probab. Comput., 1993
Turán-Ramsey theorems and simple asymptotically extremal structures.
Comb., 1993
Clique coverings of the edges of a random graph.
Comb., 1993
1992
Distributed Loop Network with Minimum Transmission Delay.
Theor. Comput. Sci., 1992
Optimum Multiple Access Coding (D.B. Jevtić).
SIAM Rev., 1992
Diverse Homogeneous Sets.
J. Comb. Theory, Ser. A, 1992
Arithmetic progressions in subset sums.
Discret. Math., 1992
Covering the cliques of a graph with vertices.
Discret. Math., 1992
Extremal problems involving vertices and edges on odd cycles.
Discret. Math., 1992
Bounds for arrays of dots with distinct slopes or lengths.
Comb., 1992
In memory of Tibor Gallai.
Comb., 1992
1991
Midpoints of Diagonals of Convex <i>n</i>-GONS.
SIAM J. Discret. Math., 1991
The Dimension of Random Ordered Sets.
Random Struct. Algorithms, 1991
Some extremal results in cochromatic and dichromatic theory.
J. Graph Theory, 1991
Local constraints ensuring small representing sets.
J. Comb. Theory, Ser. A, 1991
Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory, Ser. B, 1991
Matchings from a set below to a set above.
Discret. Math., 1991
Some Ramsey-type theorems.
Discret. Math., 1991
Saturated r-uniform hypergraphs.
Discret. Math., 1991
Degree sequences in triangle-free graphs.
Discret. Math., 1991
Lopsided Lovász Local Lemma and Latin transversals.
Discret. Appl. Math., 1991
Distinct Distances Determined By Subsets of a Point Set in Space.
Comput. Geom., 1991
1990
Representations of Integers as the Sum of k Terms.
Random Struct. Algorithms, 1990
Quasi-progressions and descending waves.
J. Comb. Theory, Ser. A, 1990
Colouring prime distance graphs.
Graphs Comb., 1990
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number.
Eur. J. Comb., 1990
Subgraphs of minimal degree k.
Discret. Math., 1990
Countable Decompositions of R<sup>2</sup> and R<sup>3</sup>.
Discret. Comput. Geom., 1990
Variation on the theme of repeated distances.
Comb., 1990
Gaps in Difference Sets, and the Graph of Nearly Equal Distances.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Tight bounds on the chromatic sum of a connected graph.
J. Graph Theory, 1989
Domination in colored complete graphs.
J. Graph Theory, 1989
Representations of graphs and orthogonal latin square graphs.
J. Graph Theory, 1989
Maximal antiramsey graphs and the strong chromatic number.
J. Graph Theory, 1989
J. Comb. Theory, Ser. A, 1989
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B, 1989
On the number of partitions of n without a given subsum (I).
Discret. Math., 1989
On the number of distinct induced subgraphs of a graph.
Discret. Math., 1989
On the Graph of Large Distance.
Discret. Comput. Geom., 1989
Disjoint Edges in Geometric Graphs.
Discret. Comput. Geom., 1989
Discret. Appl. Math., 1989
The size of chordal, interval and threshold subgraphs.
Comb., 1989
1988
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays.
Math. Syst. Theory, 1988
Cutting a graph into two dissimilar halves.
J. Graph Theory, 1988
A tribute to Torrence Parsons.
J. Graph Theory, 1988
Graphs with unavoidable subgraphs with large degrees.
J. Graph Theory, 1988
How to make a graph bipartite.
J. Comb. Theory, Ser. B, 1988
Repeated distances in space.
Graphs Comb., 1988
Intersection Graphs for Families of Balls in R<sup>n</sup>.
Eur. J. Comb., 1988
Extremal theory and bipartite graph-tree Ramsey numbers.
Discret. Math., 1988
Clique partitions and clique coverings.
Discret. Math., 1988
Problems and results in combinatorial analysis and graph theory.
Discret. Math., 1988
Optima of dual integer linear programs.
Comb., 1988
On Admissible Constellations of Consecutive Primes.
BIT, 1988
1987
On the equality of the grundy and ochromatic numbers of a graph.
J. Graph Theory, 1987
On unavoidable hypergraphs.
J. Graph Theory, 1987
Goodness of trees for generalized books.
Graphs Comb., 1987
k-Connectivity in Random Graphs.
Eur. J. Comb., 1987
Extremal problems on permutations under cyclic equivalence.
Discret. Math., 1987
A Ramsey problem of Harary on graphs with prescribed size.
Discret. Math., 1987
1986
Maximum induced trees in graphs.
J. Comb. Theory, Ser. B, 1986
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.
Graphs Comb., 1986
Two problems in extremal graph theory.
Graphs Comb., 1986
Coloring graphs with locally few colors.
Discret. Math., 1986
Clique numbers of graphs.
Discret. Math., 1986
On some metric and combinatorial geometric problems.
Discret. Math., 1986
Extremal clique coverings of complementary graphs.
Comb., 1986
1985
Ulam, the man and the mathematician.
J. Graph Theory, 1985
J. Comb. Theory, Ser. A, 1985
J. Comb. Theory, Ser. B, 1985
Extremal subgraphs for two graphs.
J. Comb. Theory, Ser. B, 1985
Quantitative Forms of a Theorem of Hilbert.
J. Comb. Theory, Ser. A, 1985
An Application of Graph Theory to Additive Number Theory.
Eur. J. Comb., 1985
A note on the interval number of a graph.
Discret. Math., 1985
Chromatic number of finite and infinite graphs and hypergraphs.
Discret. Math., 1985
Multipartite graph - space graph Ramsey numbers.
Comb., 1985
On the existence of two non-neighboring subgraphs in a graph.
Comb., 1985
Dual Integer Linear Programs and the Relationship between their Optima
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
Bounds on threshold dimension and disjoint threshold coverings (abstract only).
Proceedings of the 13th ACM Annual Conference on Computer Science, 1985
1984
Addendum to "trees in random graphs".
Discret. Math., 1984
Enumeration of intersecting families.
Discret. Math., 1984
1983
Local connectivity of a random graph.
J. Graph Theory, 1983
On a Quasi-Ramsey problem.
J. Graph Theory, 1983
Generalizations of a Ramsey-theoretic result of chvátal.
J. Graph Theory, 1983
Finite linear spaces and projective planes.
Discret. Math., 1983
Supersaturated graphs and hypergraphs.
Comb., 1983
More results on Ramsey - Turán Type problems.
Comb., 1983
1982
Graphs with certain families of spanning trees.
J. Comb. Theory, Ser. B, 1982
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory, Ser. A, 1982
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.
J. Comb. Theory, Ser. A, 1982
On a problem in combinatorial geometry.
Discret. Math., 1982
Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
Discret. Math., 1982
Ramsey-minimal graphs for forests.
Discret. Math., 1982
On Ramsey - Turán type theorems for hypergraphs.
Comb., 1982
Compactness results in extremal graph theory.
Comb., 1982
Personal reminiscences and remarks on the mathematical work of Tibor Gallai.
Comb., 1982
1981
Some Bounds for the Ramsey-Paris-Harrington Numbers.
J. Comb. Theory, Ser. A, 1981
Ramsey-minimal graphs for star-forests.
Discret. Math., 1981
On the conjecture of Hajós.
Comb., 1981
On the combinatorial problems which I would most like to see solved.
Comb., 1981
Minimal decompositions of graphs into mutually isomorphic subgraphs.
Comb., 1981
On Turáns theorem for sparse graphs.
Comb., 1981
Sets of natural numbers of positive density and cylindric set algebras of dimension 2.
Algebra Universalis, 1981
1980
Random Graph Isomorphism.
SIAM J. Comput., 1980
Maximum degree in graphs of diameter 2.
Networks, 1980
Some Applications of Ramsey's Theorem to Additive Number Theory.
Eur. J. Comb., 1980
Hadwiger's Conjecture is True for Almost Every Graph.
Eur. J. Comb., 1980
On a problem of L. Fejes Tóth.
Discret. Math., 1980
1978
When the cartesian product of directed cycles is Hamiltonian.
J. Graph Theory, 1978
A class of Hamiltonian regular graphs.
J. Graph Theory, 1978
On cycle - Complete graph ramsey numbers.
J. Graph Theory, 1978
Combinatorial Properties of Systems of Sets.
J. Comb. Theory, Ser. A, 1978
Some Combinatorial Problems in the Plane.
J. Comb. Theory, Ser. A, 1978
On finite superuniversal graphs.
Discret. Math., 1978
On additive partitions of integers.
Discret. Math., 1978
1977
Paul Turán, 1910-1976: His work in graph theory.
J. Graph Theory, 1977
On the chromatic index of almost all graphs.
J. Comb. Theory, Ser. B, 1977
Hamiltonian cycles in regular graphs of moderate degree.
J. Comb. Theory, Ser. B, 1977
On a problem in extremal graph theory.
J. Comb. Theory, Ser. B, 1977
On total matching numbers and total covering numbers of complementary graphs.
Discret. Math., 1977
1976
Partition Theorems for Subsets of Vector Spaces.
J. Comb. Theory, Ser. A, 1976
On a Ramsey-Turán type problem.
J. Comb. Theory, Ser. B, 1976
1975
On Packing Squares with Equal Squares.
J. Comb. Theory, Ser. A, 1975
Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n.
Discret. Math., 1975
On complete subgraphs of r-chromatic graphs.
Discret. Math., 1975
1974
Remark on a Theorem of Lindström.
J. Comb. Theory, Ser. A, 1974
Extremal problems among subsets of a set.
Discret. Math., 1974
On the connection between chromatic number, maximal clique and minimal degree of a graph.
Discret. Math., 1974
1973
J. Comb. Theory, Ser. A, 1973
Euclidean Ramsey Theorems I.
J. Comb. Theory, Ser. A, 1973
On a valence problem in extremal graph theory.
Discret. Math., 1973
On a generalization of Ramsey numbers.
Discret. Math., 1973
1972
Separability properties of almost — disjoint families of sets.
Israel Journal of Mathematics, March, 1972
Ramsey's theorem and self-complementary graphs.
Discret. Math., 1972
A note on Hamiltonian circuits.
Discret. Math., 1972
1971
Imbalances in k-colorations.
Networks, 1971
On some extremal problems on r-graphs.
Discret. Math., 1971
1959
Elementary Divisors of Normal Matrices.
IBM J. Res. Dev., 1959
1957
Sur la décomposition de l'espace euclidien en ensembles homogènes.
Acta Mathematica Hungarica, 1957