Vojtech Rödl

  • Emory University, Atlanta, Department of Mathematics and Computer Science

According to our database1, Vojtech Rödl authored at least 292 papers between 1977 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Independence number of hypergraphs under degree conditions.
Random Struct. Algorithms, October, 2023

Colorful Matchings.
SIAM J. Discret. Math., June, 2023

Covering the edges of a random hypergraph by cliques.
Discuss. Math. Graph Theory, 2022

A blurred view of Van der Waerden type theorems.
Comb. Probab. Comput., 2022

Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.
Electron. J. Comb., 2022

Independent Sets in Subgraphs of a Shift Graph.
Electron. J. Comb., 2022

Extractors for Small Zero-Fixing Sources.
Comb., 2022

On Hamiltonian cycles in hypergraphs with dense link graphs.
J. Comb. Theory B, 2021

On strong Sidon sets of integers.
J. Comb. Theory A, 2021

On local Turán problems.
J. Comb. Theory A, 2021

Increasing paths in countable graphs.
J. Comb. Theory A, 2021

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Packing Paths in Steiner Triple Systems.
SIAM J. Discret. Math., 2019

The size Ramsey number of short subdivisions of bounded degree graphs.
Random Struct. Algorithms, 2019

A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.
Electron. Colloquium Comput. Complex., 2019

A note on weak delta systems.
Discret. Math., 2019

Infinite Sidon Sets Contained in Sparse Random Sets of Integers.
SIAM J. Discret. Math., 2018

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discret. Math., 2018

An algorithmic hypergraph regularity lemma.
Random Struct. Algorithms, 2018

Ramsey Partial Orders from Acyclic Graphs.
Order, 2018

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.
J. Lond. Math. Soc., 2018

A Ramsey class for Steiner systems.
J. Comb. Theory A, 2018

The Minimum Number of Edges in Uniform Hypergraphs with Property O.
Comb. Probab. Comput., 2018

On the Size-Ramsey Number of Hypergraphs.
J. Graph Theory, 2017

The chromatic number of finite type-graphs.
J. Comb. Theory B, 2017

Ramsey properties of random graphs and Folkman numbers.
Discuss. Math. Graph Theory, 2017

Note on a Ramsey Theorem for Posets with Linear Extensions.
Electron. J. Comb., 2017

An exponential-type upper bound for Folkman numbers.
Comb., 2017

The complexity of proving that a graph is Ramsey.
Comb., 2017

Isomorphic edge disjoint subgraphs of hypergraphs.
Random Struct. Algorithms, 2016

On induced Ramsey numbers for <i>k</i>-uniform hypergraphs.
Random Struct. Algorithms, 2016

Embedding tetrahedra into quasirandom hypergraphs.
J. Comb. Theory B, 2016

Packing minor-closed families of graphs into complete graphs.
J. Comb. Theory B, 2016

The number of B<sub>3</sub>-sets of a given cardinality.
J. Comb. Theory A, 2016

A note on supersaturated set systems.
Eur. J. Comb., 2016

A short proof of the induced Ramsey Theorem for hypergraphs.
Discret. Math., 2016

On the Number of <i>B<sub>h</sub> </i>-Sets.
Comb. Probab. Comput., 2016

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015

An improved upper bound on the density of universal random graphs.
Random Struct. Algorithms, 2015

Packing minor closed families of graphs.
Electron. Notes Discret. Math., 2015

Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electron. Notes Discret. Math., 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Comb. Probab. Comput., 2015

On generalized Ramsey numbers of Erdős and Rogers.
J. Comb. Theory B, 2014

Families of triples with high minimum degree are Hamiltonian.
Discuss. Math. Graph Theory, 2014

Degree Ramsey Numbers of Closed Blowups of Trees.
Electron. J. Comb., 2014

Jumps and Nonjumps in Multigraphs.
SIAM J. Discret. Math., 2013

Note on the point character of <i>l</i> <sub>1</sub>-spaces.
Period. Math. Hung., 2013

Maximal independent sets in the covering graph of the cube.
Discret. Appl. Math., 2013

Some recent results on Ramsey-type numbers.
Discret. Appl. Math., 2013

Note on Upper Density of Quasi-Random Hypergraphs.
Electron. J. Comb., 2013

Arrangeability and Clique Subdivisions.
Proceedings of the Mathematics of Paul Erdős II, 2013

Universality of Random Graphs.
SIAM J. Discret. Math., 2012

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
SIAM J. Discret. Math., 2012

Complete Partite subgraphs in dense hypergraphs.
Random Struct. Algorithms, 2012

On induced Folkman numbers.
Random Struct. Algorithms, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Comb. Probab. Comput., 2012

Distance Preserving Ramsey Graphs.
Comb. Probab. Comput., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012

On a conjecture of Thomassen concerning subgraphs of large girth.
J. Graph Theory, 2011

A note on Thomassenʼs conjecture.
J. Comb. Theory B, 2011

Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb., 2011

On <i>K</i><sub><i>s</i></sub>-free subgraphs in <i>K</i><sub><i>s</i>+<i>k</i></sub>-free graphs and vertex Folkman numbers.
Comb., 2011

Hereditary quasirandom properties of hypergraphs.
Comb., 2011

The maximum size of a Sidon set contained in a sparse random set of integers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput., 2010

Constructions of sparse uniform hypergraphs with high chromatic number.
Random Struct. Algorithms, 2010

Ramsey properties of random discrete structures.
Random Struct. Algorithms, 2010

Some constructive bounds on Ramsey numbers.
J. Comb. Theory B, 2010

Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory B, 2010

An almost quadratic bound on vertex Folkman numbers.
J. Comb. Theory B, 2010

Note on robust critical graphs with large odd girth.
Discret. Math., 2010

On the number of graphs with a given endomorphism monoid.
Discret. Math., 2010

On graphs with a given endomorphism monoid.
J. Graph Theory, 2009

Perfect matchings in large uniform hypergraphs with large minimum collective degree.
J. Comb. Theory A, 2009

Representing Subdirect Product Monoids by Graphs.
Int. J. Algebra Comput., 2009

Hereditary quasi-random properties of hypergraphs.
Electron. Notes Discret. Math., 2009

On k-chromatically connected graphs.
Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.
Comb. Probab. Comput., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput., 2009

A Note on Universal and Canonically Coloured Sequences.
Comb. Probab. Comput., 2009

Generalizations of the removal lemma.
Comb., 2009

Hypergraph regularity and quasi-randomness.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On Ramsey Minimal Graphs.
SIAM J. Discret. Math., 2008

An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput., 2008

Triangulations and the Hajós conjecture.
J. Graph Theory, 2008

JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.
Internet Math., 2008

On the Ramsey Number of Sparse 3-Graphs.
Graphs Comb., 2008

Finding Folkman Numbers via MAX CUT Problem.
Electron. Notes Discret. Math., 2008

Colorful Flowers.
Electron. Notes Discret. Math., 2008

On the Folkman Number <i>f</i>(2, 3, 4).
Exp. Math., 2008

Note on the 3-graph counting lemma.
Discret. Math., 2008

On the Turán Properties of Infinite Graphs.
Electron. J. Comb., 2008

An approximate Dirac-type theorem for <i>k</i> -uniform hypergraphs.
Comb., 2008

New Upper Bound on Vertex Folkman Numbers.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.
SIAM J. Discret. Math., 2007

Integer and fractional packings of hypergraphs.
J. Comb. Theory B, 2007

On the chromatic number and independence number of hypergraph products.
J. Comb. Theory B, 2007

Turán's theorem for pseudo-random graphs.
J. Comb. Theory A, 2007

Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory B, 2007

A note on the jumping constant conjecture of Erdös.
J. Comb. Theory B, 2007

Regular Partitions of Hypergraphs: Counting Lemmas.
Comb. Probab. Comput., 2007

Regular Partitions of Hypergraphs: Regularity Lemmas.
Comb. Probab. Comput., 2007

Property testing in hypergraphs and the removal lemma.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Applications of the regularity lemma for uniform hypergraphs.
Random Struct. Algorithms, 2006

The counting lemma for regular <i>k</i>-uniform hypergraphs.
Random Struct. Algorithms, 2006

Color critical hypergraphs with many edges.
J. Graph Theory, 2006

A note on a conjecture by Füredi.
J. Comb. Theory A, 2006

Short paths in quasi-random triple systems with sparse underlying graphs.
J. Comb. Theory B, 2006

On Ramsey numbers of uniform hypergraphs with given maximum degree.
J. Comb. Theory A, 2006

The Ramsey number for hypergraph cycles I.
J. Comb. Theory A, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.
Eur. J. Comb., 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.
Comb. Probab. Comput., 2006

Measures of Pseudorandomness for Finite Sequences: Minimal Values.
Comb. Probab. Comput., 2006

Supersaturation For Ramsey-Turán Problems.
Comb., 2006

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.
Memoirs of the American Mathematical Society 845, American Mathematical Society, ISBN: 978-0-8218-3825-9, 2006

Counting subgraphs in quasi-random 4-uniform hypergraphs.
Random Struct. Algorithms, 2005

Every Monotone 3-Graph Property is Testable.
Electron. Notes Discret. Math., 2005

On Cover Graphs and Dependent Arcs in Acyclic Orientations.
Comb. Probab. Comput., 2005

Counting Small Cliques in 3-uniform Hypergraphs.
Comb. Probab. Comput., 2005

Distance Graphs on the Integers.
Comb. Probab. Comput., 2005

Sharp Bounds For Some Multicolor Ramsey Numbers.
Comb., 2005

The Generalization of Dirac's Theorem for Hypergraphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Regularity Lemma for k-uniform hypergraphs.
Random Struct. Algorithms, 2004

The Turán Theorem for Random Graphs.
Comb. Probab. Comput., 2004

Uniform Edge Distribution in Hypergraphs is Hereditary.
Electron. J. Comb., 2004

On Graphs With Small Ramsey Numbers, II.
Comb., 2004

An Optimal Algorithm for Checking Regularity.
SIAM J. Comput., 2003

Regularity properties for triple systems.
Random Struct. Algorithms, 2003

Regular pairs in sparse random graphs I.
Random Struct. Algorithms, 2003

Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms, 2003

On large intersecting subfamilies of uniform setfamilies.
Random Struct. Algorithms, 2003

On homogeneous sets of positive integers.
J. Comb. Theory A, 2003

Independent Deuber sets in graphs on the natural numbers.
J. Comb. Theory A, 2003

Hereditary Properties Of Triple Systems.
Comb. Probab. Comput., 2003

Ramsey Games Against a One-Armed Bandit.
Comb. Probab. Comput., 2003

Extremal problems on set systems.
Random Struct. Algorithms, 2002

On characterizing hypergraph regularity.
Random Struct. Algorithms, 2002

On the Turán Number of Triple Systems.
J. Comb. Theory A, 2002

Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory A, 2002

Ramsey Properties of Families of Graphs.
J. Comb. Theory B, 2002

Holes in Graphs.
Electron. J. Comb., 2002

An optimal algorithm for checking regularity (extended abstract).
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Efficient Testing of Hypergraphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.
SIAM J. Comput., 2001

On the chromatic number of set systems.
Random Struct. Algorithms, 2001

On graphs with small Ramsey numbers.
J. Graph Theory, 2001

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.
J. Comb. Theory A, 2001

The asymptotic number of triple systems not containing a fixed one.
Discret. Math., 2001

Integer and Fractional Packings in Dense Graphs.
Comb., 2001

On Bipartite Graphs with Linear Ramsey Numbers.
Comb., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.
Proceedings of the Approximation, 2001

An Algorithmic Regularity Lemma for Hypergraphs.
SIAM J. Comput., 2000

On graphs with linear Ramsey numbers.
J. Graph Theory, 2000

On Size Ramsey Numbers of Graphs with Bounded Degree.
Comb., 2000

Equivalent Conditions for Regularity (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Algorithmic Aspects of Regularity.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Universality and Tolerance.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discret. Math., 1999

Non-Ramsey Graphs Are c log n-Universal.
J. Comb. Theory A, 1999

Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.
J. Comb. Theory A, 1999

Hypergraph Packing And Graph Embedding.
Comb. Probab. Comput., 1999

Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma.
Comb., 1999

Partial Steiner systems and matchings in hypergraphs.
Random Struct. Algorithms, 1998

Ramsey Properties of Random Hypergraphs.
J. Comb. Theory A, 1998

Independent finite sums in graphs defined on the natural numbers.
Discret. Math., 1998

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Comb. Probab. Comput., 1998

Extremal Problems for Affine Cubes of Integers.
Comb. Probab. Comput., 1998

Endomorphisms of Partially Ordered Sets.
Comb. Probab. Comput., 1998

Perfect Matchings in ε-regular Graphs.
Electron. J. Comb., 1998

On Large Systems of Sets with No Large Weak <Delta>-subsystems.
Comb., 1998

Induced Ramsey Numbers.
Comb., 1998

An Algorithmic Embedding of Graphs via Perfect Matchings.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Boolean Circuits, Tensor Ranks, and Communication Complexity.
SIAM J. Comput., 1997

Note on regular subgraphs.
J. Graph Theory, 1997

On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.
J. Comb. Theory A, 1997

Chromatic Ramsey Theory.
Eur. J. Comb., 1997

Bipartite Coverings of Graphs.
Comb. Probab. Comput., 1997

On <i>K</i><sup>4</sup>-Free Subgraphs of Random Graphs.
Comb., 1997

Asymptotic packing and the random greedy algorithm.
Random Struct. Algorithms, 1996

Ramsey-type results for oriented trees.
J. Graph Theory, 1996

On <i>p</i>-intersection representations.
J. Graph Theory, 1996

On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.
J. Comb. Theory B, 1996

Multicolored Subsets in Colored Hypergraphs.
J. Comb. Theory A, 1996

Applications of hypergraph coloring to coloring graphs not inducing certain trees.
Discret. Math., 1996

Graphs of Small Dimensions.
Comb., 1996

Proper Bounded Edge-Colorings.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
SIAM J. Comput., 1995

On the Genus of a Random Graph.
Random Struct. Algorithms, 1995

Covering of r-Graphs by Complete r-Partite Subgraphs.
Random Struct. Algorithms, 1995

On Uncrowded Hypergraphs.
Random Struct. Algorithms, 1995

On the Computational Complexity of Ordered Subgraph Recognition.
Random Struct. Algorithms, 1995

On the Jumping Constant Conjecture for Multigraphs.
J. Comb. Theory A, 1995

Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory B, 1995

On Ramsey Sets in Spheres.
J. Comb. Theory A, 1995

Shift graphs and lower bounds on Ramsey numbers r<sub>k</sub>(l; r).
Discret. Math., 1995

Ramsey Families which Exclude a Graph.
Comb., 1995

On Erdös-Rado Numbers.
Comb., 1995

The Minimum Independence Number for Designs.
Comb., 1995

Note on Independent Sets in Steiner Systems.
Random Struct. Algorithms, 1994

Random Graphs with Monochromatic Triangles in Every Edge Coloring.
Random Struct. Algorithms, 1994

Unbalanced Steiner Triple Systems.
J. Comb. Theory A, 1994

The Erdös-Ko-Rado Theorem for Small Families.
J. Comb. Theory A, 1994

The Algorithmic Aspects of the Regularity Lemma.
J. Algorithms, 1994

Some combinatorial-algebraic problems from complexity theory.
Discret. Math., 1994

Monochromatic Trees with Respect to Edge Partitions.
J. Comb. Theory B, 1993

On Canonical Ramsey Numbers for Complete Graphs versus Paths.
J. Comb. Theory B, 1993

Rigid Linear Binary Codes.
J. Comb. Theory A, 1993

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
J. Comb. Theory B, 1993

On isomorphic subgraphs.
Discret. Math., 1993

2-Colorings of complete graphs with a small number of monochromatic K<sub>4</sub> subgraphs.
Discret. Math., 1993

Modified ranks of tensors and the size of circuits.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms, 1992

A Canonical Ramsey Theorem.
Random Struct. Algorithms, 1992

On embedding of graphs into euclidean spaces of small dimension.
J. Comb. Theory B, 1992

Monochromatic Vs multicolored paths.
Graphs Comb., 1992

The Uniformity Lemma for hypergraphs.
Graphs Comb., 1992

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Graphs Comb., 1992

On coverings of infinite- dimentional metric spaces.
Discret. Math., 1992

On Ramsey graphs without bipartite subgraphs.
Discret. Math., 1992

Cycle-connected graphs.
Discret. Math., 1992

A combinatorial approach to complexity.
Comb., 1992

The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

A ramsey type problem concerning vertex colourings.
J. Comb. Theory B, 1991

The number of t-wise balance designs.
Comb., 1991

Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci., 1990

Iterated combinatorial density theorems.
J. Comb. Theory A, 1990

On ramsey families of sets.
Graphs Comb., 1990

On the dimension to represent a graph by a unit distance graph.
Graphs Comb., 1990

A Ramsey-Type Theorem for Orderings of a Graph.
SIAM J. Discret. Math., 1989

Chromatically optimal rigid graphs.
J. Comb. Theory B, 1989

Geometrical embeddings of graphs.
Discret. Math., 1989

The partite construction and ramsey set systems.
Discret. Math., 1989

Percentages in pairwise balanced designs.
Discret. Math., 1989

Embeddings of Graphs in Euclidean Spaces.
Discret. Comput. Geom., 1989

Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discret. Math., 1988

The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory B, 1988

Quantitative theorems for regular systems of equations.
J. Comb. Theory A, 1988

Embedding of trees in euclidean spaces.
Graphs Comb., 1988

Some Ramsey - Turán type results for hypergraphs.
Comb., 1988

Graph Complexity.
Acta Informatica, 1988

Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory B, 1987

Induced restricted Ramsey theorems for spaces.
J. Comb. Theory A, 1987

On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory A, 1987

Multiple Optima in Local Search.
J. Algorithms, 1987

Small Spaces with Large Point Character.
Eur. J. Comb., 1987

A note on ranking functions.
Discret. Math., 1987

An elementary proof of the canonizing version of Gallai-Witt's theorem.
J. Comb. Theory A, 1986

Note on decomposition of spheres in Hilbert spaces.
J. Comb. Theory A, 1986

Finite union theorem with restrictions.
Graphs Comb., 1986

On sets of integers with the Schur property.
Graphs Comb., 1986

Coloring of universal graphs.
Graphs Comb., 1986

Large triangle-free subgraphs in graphs without<i>K</i><sub>4</sub>.
Graphs Comb., 1986

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.
Graphs Comb., 1986

On universality of graphs with uniformly distributed edges.
Discret. Math., 1986

Coloring graphs with locally few colors.
Discret. Math., 1986

Two lower bounds for branching programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

On color critical graphs.
J. Comb. Theory B, 1985

Canonizing Ordering Theorems for Hales Jewett Structures.
J. Comb. Theory A, 1985

On graphs with small subgraphs of large chromatic number.
Graphs Comb., 1985

Note on a Ramsey-Turán type problem.
Graphs Comb., 1985

Lower bounds for Turán's problem.
Graphs Comb., 1985

On a Packing and Covering Problem.
Eur. J. Comb., 1985

Near Perfect Coverings in Graphs and Hypergraphs.
Eur. J. Comb., 1985

Threshold hypergraphs.
Discret. Math., 1985

Two remarks on Ramsey's theorem.
Discret. Math., 1985

On the use of senders in generalized ramsey theory for graphs.
Discret. Math., 1985

Geometrical Realization of Set Systems and Probabilistic Communication Complexity
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

On the minimum order of graphs with given semigroup.
J. Comb. Theory B, 1984

On combinatorial properties of spheres in eulidean spaces.
Comb., 1984

On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.
Comb., 1984

Sparse Ramsey graphs.
Comb., 1984

Hypergraphs do not jump.
Comb., 1984

On a product dimension of bipartite graphs.
J. Graph Theory, 1983

Ramsey Classes of Set Systems.
J. Comb. Theory A, 1983

Another Proof of the Folkman-Rado-Sanders Theorem.
J. Comb. Theory A, 1983

The Ramsey number of a graph with bounded maximum degree.
J. Comb. Theory B, 1983

On a problem in combinatorial geometry.
Discret. Math., 1983

On qualitatively independent partitions and related problems.
Discret. Appl. Math., 1983

Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.
Eur. J. Comb., 1982

Partition theorems for systems of finite subsets of integers.
Discret. Math., 1982

Colouring steiner quadruple systems.
Discret. Appl. Math., 1982

Nearly bipartite graphs with large chromatic number.
Comb., 1982

Monotone paths in ordered graphs.
Comb., 1982

On the arc-chromatic number of a digraph.
J. Comb. Theory B, 1981

On set systems determined by intersections.
Discret. Math., 1981

Complexity of representation of graphs by set systems.
Discret. Appl. Math., 1981

Simple proof of the existence of restricted Ramsey graphs by means of a partite construction.
Comb., 1981

Fast Recognition of Rings and Lattices.
Proceedings of the Fundamentals of Computation Theory, 1981

A short proof of the existence of highly chromatic hypergraphs without short cycles.
J. Comb. Theory B, 1979

A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph.
Discret. Math., 1978

Partitions of Finite Relational and Set Systems.
J. Comb. Theory A, 1977