Vojtech Rödl

J. Comb. Theory B, 2026

2025

Subgraphs with a positive minimum semidegree in digraphs with large outdegree.

[BibT_eX]

[DOI]

Andrzej Grzesik

Jan Volec

Innov. Graph Theory, 2025

The number of cliques in hypergraphs with forbidden subgraphs.

[BibT_eX]

[DOI]

Ayush Basu

Yi Zhao

Discret. Math., 2025

On Set Representation of Bounded Degree Hypergaphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

On Pisier Type Theorems.

[BibT_eX]

[DOI]

Comb., December, 2024

Equivalent regular partitions of three-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2024

Some results and problems on clique coverings of hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

On the Ramsey numbers of daisies I.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

A note on the induced Ramsey theorem for spaces.

[BibT_eX]

[DOI]

Bryce Frederickson

Comb. Theory, 2024

2023

Independence number of hypergraphs under degree conditions.

[BibT_eX]

[DOI]

Yi Zhao

Random Struct. Algorithms, October, 2023

Colorful Matchings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

2022

Covering the edges of a random hypergraph by cliques.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

A blurred view of Van der Waerden type theorems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Independent Sets in Subgraphs of a Shift Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Extractors for Small Zero-Fixing Sources.

[BibT_eX]

[DOI]

Comb., 2022

2021

On Hamiltonian cycles in hypergraphs with dense link graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

On strong Sidon sets of integers.

[BibT_eX]

[DOI]

Sang June Lee

Carlos Gustavo Moreira

J. Comb. Theory A, 2021

On local Turán problems.

[BibT_eX]

[DOI]

Hao Huang

J. Comb. Theory A, 2021

Increasing paths in countable graphs.

[BibT_eX]

[DOI]

Bradley Elliott

J. Comb. Theory A, 2021

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019

Packing Paths in Steiner Triple Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

The size Ramsey number of short subdivisions of bounded degree graphs.

[BibT_eX]

[DOI]

Troy Retter

Random Struct. Algorithms, 2019

A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm.

[BibT_eX]

[DOI]

Michal Koucký

Navid Talebanfard

Electron. Colloquium Comput. Complex., 2019

A note on weak delta systems.

[BibT_eX]

[DOI]

Bill Kay

Discret. Math., 2019

2018

Infinite Sidon Sets Contained in Sparse Random Sets of Integers.

[BibT_eX]

[DOI]

Sangjune Lee

Carlos Gustavo Moreira

SIAM J. Discret. Math., 2018

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.

[BibT_eX]

[DOI]

Hiêp Hàn

Tibor Szabó

SIAM J. Discret. Math., 2018

Ramsey Partial Orders from Acyclic Graphs.

[BibT_eX]

[DOI]

Order, 2018

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.

[BibT_eX]

[DOI]

Christian Reiher

J. Lond. Math. Soc., 2018

A Ramsey class for Steiner systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

The Minimum Number of Edges in Uniform Hypergraphs with Property O.

[BibT_eX]

[DOI]

Bill Kay

Comb. Probab. Comput., 2018

2017

On the Size-Ramsey Number of Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

The chromatic number of finite type-graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Ramsey properties of random graphs and Folkman numbers.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Note on a Ramsey Theorem for Posets with Linear Extensions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

An exponential-type upper bound for Folkman numbers.

[BibT_eX]

[DOI]

Comb., 2017

2016

Isomorphic edge disjoint subgraphs of hypergraphs.

[BibT_eX]

[DOI]

Paul Horn

Random Struct. Algorithms, 2016

On induced Ramsey numbers for k-uniform hypergraphs.

[BibT_eX]

[DOI]

Steve La Fleur

Random Struct. Algorithms, 2016

Embedding tetrahedra into quasirandom hypergraphs.

[BibT_eX]

[DOI]

Christian Reiher

J. Comb. Theory B, 2016

Packing minor-closed families of graphs into complete graphs.

[BibT_eX]

[DOI]

Silvia Messuti

J. Comb. Theory B, 2016

The number of B3-sets of a given cardinality.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

A note on supersaturated set systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

A short proof of the induced Ramsey Theorem for hypergraphs.

[BibT_eX]

[DOI]

Vindya Bhat

Discret. Math., 2016

On the Number of Bh -Sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

An Algorithmic Hypergraph Regularity Lemma.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Packing minor closed families of graphs.

[BibT_eX]

[DOI]

Silvia Messuti

Electron. Notes Discret. Math., 2015

Ramsey-type numbers involving graphs and hypergraphs with large girth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

Daniel M. Martin

Asaf Shapira

Comb. Probab. Comput., 2015

2014

On generalized Ramsey numbers of Erdős and Rogers.

[BibT_eX]

[DOI]

Troy Retter

J. Comb. Theory B, 2014

Families of triples with high minimum degree are Hamiltonian.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Degree Ramsey Numbers of Closed Blowups of Trees.

[BibT_eX]

[DOI]

Paul Horn

Kevin G. Milans

Electron. J. Comb., 2014

2013

Jumps and Nonjumps in Multigraphs.

[BibT_eX]

[DOI]

Paul Horn

Steve La Fleur

SIAM J. Discret. Math., 2013

Note on the point character of l 1-spaces.

[BibT_eX]

[DOI]

Christian Avart

Péter Komjáth

Period. Math. Hung., 2013

Maximal independent sets in the covering graph of the cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Some recent results on Ramsey-type numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Note on Upper Density of Quasi-Random Hypergraphs.

[BibT_eX]

[DOI]

Vindya Bhat

Electron. J. Comb., 2013

The Complexity of Proving That a Graph Is Ramsey.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Arrangeability and Clique Subdivisions.

[BibT_eX]

[DOI]

Robin Thomas

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Complete Partite subgraphs in dense hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

On induced Folkman numbers.

[BibT_eX]

[DOI]

Reshma Ramadurai

Random Struct. Algorithms, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Distance Preserving Ramsey Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

On Even-Degree Subgraphs of Linear Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

An Improved Upper Bound on the Density of Universal Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

On a conjecture of Thomassen concerning subgraphs of large girth.

[BibT_eX]

[DOI]

Daniel M. Martin

J. Graph Theory, 2011

A note on Thomassenʼs conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Maximal independent sets in bipartite graphs obtained from Boolean lattices.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers.

[BibT_eX]

[DOI]

Comb., 2011

Hereditary quasirandom properties of hypergraphs.

[BibT_eX]

[DOI]

Comb., 2011

The maximum size of a Sidon set contained in a sparse random set of integers.

[BibT_eX]

[DOI]

Sangjune Lee

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.

[BibT_eX]

[DOI]

Subrahmanyam Kalyanasundaram

Daniel M. Martin

Asaf Shapira

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Constructions of sparse uniform hypergraphs with high chromatic number.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Ramsey properties of random discrete structures.

[BibT_eX]

[DOI]

Ehud Friedgut

Random Struct. Algorithms, 2010

Some constructive bounds on Ramsey numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Weak hypergraph regularity and linear hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

An almost quadratic bound on vertex Folkman numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Note on robust critical graphs with large odd girth.

[BibT_eX]

[DOI]

Esmeralda Nastase

Mark H. Siggers

Discret. Math., 2010

On the number of graphs with a given endomorphism monoid.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

On graphs with a given endomorphism monoid.

[BibT_eX]

[DOI]

Benjamin Shemmer

J. Graph Theory, 2009

Perfect matchings in large uniform hypergraphs with large minimum collective degree.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Representing Subdirect Product Monoids by Graphs.

[BibT_eX]

[DOI]

Benjamin Shemmer

Int. J. Algebra Comput., 2009

Hereditary quasi-random properties of hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On k-chromatically connected graphs.

[BibT_eX]

[DOI]

Esmeralda Nastase

Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

A Note on Universal and Canonically Coloured Sequences.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Generalizations of the removal lemma.

[BibT_eX]

[DOI]

Comb., 2009

Hypergraph regularity and quasi-randomness.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

On Ramsey Minimal Graphs.

[BibT_eX]

[DOI]

Mark H. Siggers

SIAM J. Discret. Math., 2008

Triangulations and the Hajós conjecture.

[BibT_eX]

[DOI]

Jan Zich

J. Graph Theory, 2008

JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.

[BibT_eX]

[DOI]

Internet Math., 2008

On the Ramsey Number of Sparse 3-Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Finding Folkman Numbers via MAX CUT Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Colorful Flowers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On the Folkman Number f(2, 3, 4).

[BibT_eX]

[DOI]

Exp. Math., 2008

Note on the 3-graph counting lemma.

[BibT_eX]

[DOI]

Discret. Math., 2008

On the Turán Properties of Infinite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

An approximate Dirac-type theorem for k -uniform hypergraphs.

[BibT_eX]

[DOI]

Comb., 2008

Universality of random graphs.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

New Upper Bound on Vertex Folkman Numbers.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Integer and fractional packings of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

On the chromatic number and independence number of hypergraph products.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Turán's theorem for pseudo-random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Small subsets inherit sparse epsilon-regularity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

A note on the jumping constant conjecture of Erdös.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Regular Partitions of Hypergraphs: Counting Lemmas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Regular Partitions of Hypergraphs: Regularity Lemmas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Property testing in hypergraphs and the removal lemma.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Applications of the regularity lemma for uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

The counting lemma for regular k-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

Color critical hypergraphs with many edges.

[BibT_eX]

[DOI]

Mark H. Siggers

J. Graph Theory, 2006

A note on a conjecture by Füredi.

[BibT_eX]

[DOI]

Eduardo Tengan

J. Comb. Theory A, 2006

Short paths in quasi-random triple systems with sparse underlying graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

On Ramsey numbers of uniform hypergraphs with given maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

The Ramsey number for hypergraph cycles I.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Perfect matchings in uniform hypergraphs with large minimum degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

A Dirac-Type Theorem for 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Measures of Pseudorandomness for Finite Sequences: Minimal Values.

[BibT_eX]

[DOI]

Carlos Gustavo T. de A. Moreira

Christian Mauduit

Comb. Probab. Comput., 2006

Supersaturation For Ramsey-Turán Problems.

[BibT_eX]

[DOI]

Comb., 2006

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.

[BibT_eX]

Memoirs of the American Mathematical Society 845, American Mathematical Society, ISBN: 978-0-8218-3825-9, 2006

2005

Counting subgraphs in quasi-random 4-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

Every Monotone 3-Graph Property is Testable.

[BibT_eX]

[DOI]

Christian Avart

Electron. Notes Discret. Math., 2005

On Cover Graphs and Dependent Arcs in Acyclic Orientations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2005

Counting Small Cliques in 3-uniform Hypergraphs.

[BibT_eX]

[DOI]

Yuejian Peng

Comb. Probab. Comput., 2005

Distance Graphs on the Integers.

[BibT_eX]

[DOI]

Mike Ferrara

Comb. Probab. Comput., 2005

Sharp Bounds For Some Multicolor Ramsey Numbers.

[BibT_eX]

[DOI]

Comb., 2005

The Generalization of Dirac's Theorem for Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

An Algorithmic Version of the Hypergraph Regularity Method.

[BibT_eX]

[DOI]

Penny E. Haxell

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2004

Regularity Lemma for k-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

The Turán Theorem for Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Uniform Edge Distribution in Hypergraphs is Hereditary.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

On Graphs With Small Ramsey Numbers, II.

[BibT_eX]

[DOI]

Comb., 2004

2003

An Optimal Algorithm for Checking Regularity.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Regularity properties for triple systems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Regular pairs in sparse random graphs I.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Integer and fractional packings in dense 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Penny E. Haxell

Random Struct. Algorithms, 2003

On large intersecting subfamilies of uniform setfamilies.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

On homogeneous sets of positive integers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Independent Deuber sets in graphs on the natural numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Hereditary Properties Of Triple Systems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Ramsey Games Against a One-Armed Bandit.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Extremal problems on set systems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

On characterizing hypergraph regularity.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

On the Turán Number of Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Hypergraphs, Quasi-randomness, and Conditions for Regularity.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Ramsey Properties of Families of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Holes in Graphs.

[BibT_eX]

[DOI]

Yuejian Peng

Electron. J. Comb., 2002

An optimal algorithm for checking regularity (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Efficient Testing of Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma.

[BibT_eX]

[DOI]

Michelle Wagner

SIAM J. Comput., 2001

On the chromatic number of set systems.

[BibT_eX]

[DOI]

Prasad Tetali

Random Struct. Algorithms, 2001

On graphs with small Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

The asymptotic number of triple systems not containing a fixed one.

[BibT_eX]

[DOI]

Discret. Math., 2001

Integer and Fractional Packings in Dense Graphs.

[BibT_eX]

[DOI]

Penny E. Haxell

Comb., 2001

On Bipartite Graphs with Linear Ramsey Numbers.

[BibT_eX]

[DOI]

Comb., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

An Algorithmic Regularity Lemma for Hypergraphs.

[BibT_eX]

[DOI]

Andrzej Czygrinow

SIAM J. Comput., 2000

On graphs with linear Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

On Size Ramsey Numbers of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Comb., 2000

Equivalent Conditions for Regularity (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Algorithmic Aspects of Regularity.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Universality and Tolerance.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Constructive Quasi-Ramsey Numbers and Tournament Ranking.

[BibT_eX]

[DOI]

Andrzej Czygrinow

SIAM J. Discret. Math., 1999

Non-Ramsey Graphs Are c log n-Universal.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

J. Comb. Theory A, 1999

Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.

[BibT_eX]

[DOI]

David S. Gunderson

Alexander F. Sidorenko

J. Comb. Theory A, 1999

Hypergraph Packing And Graph Embedding.

[BibT_eX]

[DOI]

Anusch Taraz

Comb. Probab. Comput., 1999

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

[BibT_eX]

[DOI]

Comb., 1999

1998

Partial Steiner systems and matchings in hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Ramsey Properties of Random Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1998

Independent finite sums in graphs defined on the natural numbers.

[BibT_eX]

[DOI]

Tomasz Schoen

Discret. Math., 1998

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Extremal Problems for Affine Cubes of Integers.

[BibT_eX]

[DOI]

David S. Gunderson

Comb. Probab. Comput., 1998

Endomorphisms of Partially Ordered Sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Perfect Matchings in ε-regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

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

[BibT_eX]

[DOI]

Comb., 1998

Induced Ramsey Numbers.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

Comb., 1998

An Algorithmic Embedding of Graphs via Perfect Matchings.

[BibT_eX]

[DOI]

Michelle Wagner

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997

Boolean Circuits, Tensor Ranks, and Communication Complexity.

[BibT_eX]

[DOI]

Jirí Sgall

SIAM J. Comput., 1997

Note on regular subgraphs.

[BibT_eX]

[DOI]

Beata Wysocka

J. Graph Theory, 1997

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

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Chromatic Ramsey Theory.

[BibT_eX]

[DOI]

Norbert Sauer

Robert E. Woodrow

Eur. J. Comb., 1997

Bipartite Coverings of Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

On K4-Free Subgraphs of Random Graphs.

[BibT_eX]

[DOI]

Comb., 1997

1996

Asymptotic packing and the random greedy algorithm.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Ramsey-type results for oriented trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

On p-intersection representations.

[BibT_eX]

[DOI]

Nancy Eaton

Ronald J. Gould

J. Graph Theory, 1996

On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

Multicolored Subsets in Colored Hypergraphs.

[BibT_eX]

[DOI]

Beata Wysocka

J. Comb. Theory A, 1996

Applications of hypergraph coloring to coloring graphs not inducing certain trees.

[BibT_eX]

[DOI]

Hal A. Kierstead

Discret. Math., 1996

Graphs of Small Dimensions.

[BibT_eX]

[DOI]

Nancy Eaton

Claudia Bertram-Kretzberg

Comb., 1996

Proper Bounded Edge-Colorings.

[BibT_eX]

Beata Wysocka

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

On the Genus of a Random Graph.

[BibT_eX]

[DOI]

Robin Thomas

Random Struct. Algorithms, 1995

Covering of r-Graphs by Complete r-Partite Subgraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

On Uncrowded Hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

On the Computational Complexity of Ordered Subgraph Recognition.

[BibT_eX]

[DOI]

Mark Ginn

Random Struct. Algorithms, 1995

On the Jumping Constant Conjecture for Multigraphs.

[BibT_eX]

Alexander F. Sidorenko

J. Comb. Theory A, 1995

Dense Graphs without 3-Regular Subgraphs.

[BibT_eX]

[DOI]

László Pyber

J. Comb. Theory B, 1995

On Ramsey Sets in Spheres.

[BibT_eX]

Jirí Matousek

J. Comb. Theory A, 1995

Shift graphs and lower bounds on Ramsey numbers rk(l; r).

[BibT_eX]

[DOI]

Discret. Math., 1995

Ramsey Families which Exclude a Graph.

[BibT_eX]

[DOI]

Norbert Sauer

Xuding Zhu

Comb., 1995

On Erdös-Rado Numbers.

[BibT_eX]

[DOI]

Comb., 1995

The Minimum Independence Number for Designs.

[BibT_eX]

[DOI]

David A. Grable

Kevin T. Phelps

Comb., 1995

1994

Note on Independent Sets in Steiner Systems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Random Graphs with Monochromatic Triangles in Every Edge Coloring.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Unbalanced Steiner Triple Systems.

[BibT_eX]

Lucien Haddad

J. Comb. Theory A, 1994

The Erdös-Ko-Rado Theorem for Small Families.

[BibT_eX]

J. Comb. Theory A, 1994

The Algorithmic Aspects of the Regularity Lemma.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Some combinatorial-algebraic problems from complexity theory.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

Monochromatic Trees with Respect to Edge Partitions.

[BibT_eX]

[DOI]

Bernd Voigt

J. Comb. Theory B, 1993

On Canonical Ramsey Numbers for Complete Graphs versus Paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Rigid Linear Binary Codes.

[BibT_eX]

Kevin T. Phelps

J. Comb. Theory A, 1993

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.

[BibT_eX]

[DOI]

David S. Gunderson

Norbert W. Sauer

J. Comb. Theory B, 1993

On isomorphic subgraphs.

[BibT_eX]

[DOI]

Ronald J. Gould

Discret. Math., 1993

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs.

[BibT_eX]

[DOI]

Frantisek Franek

Discret. Math., 1993

Modified ranks of tensors and the size of circuits.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Rainbow Subgraphs in Properly Edge-colored Graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

Random Struct. Algorithms, 1992

A Canonical Ramsey Theorem.

[BibT_eX]

[DOI]

Nancy Eaton

Random Struct. Algorithms, 1992

On embedding of graphs into euclidean spaces of small dimension.

[BibT_eX]

[DOI]

Jan Reiterman

J. Comb. Theory B, 1992

Monochromatic Vs multicolored paths.

[BibT_eX]

[DOI]

Robin Thomas

Graphs Comb., 1992

The Uniformity Lemma for hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1992

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.

[BibT_eX]

[DOI]

Frantisek Franek

Graphs Comb., 1992

On coverings of infinite- dimentional metric spaces.

[BibT_eX]

[DOI]

Jan Pelant

Discret. Math., 1992

On Ramsey graphs without bipartite subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Cycle-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

A combinatorial approach to complexity.

[BibT_eX]

[DOI]

Comb., 1992

The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

A ramsey type problem concerning vertex colourings.

[BibT_eX]

[DOI]

Jason I. Brown

J. Comb. Theory B, 1991

The number of t-wise balance designs.

[BibT_eX]

[DOI]

Comb., 1991

1990

Lower Bounds to the Complexity of Symmetric Boolean Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Iterated combinatorial density theorems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

On ramsey families of sets.

[BibT_eX]

[DOI]

Graphs Comb., 1990

On the dimension to represent a graph by a unit distance graph.

[BibT_eX]

[DOI]

Hiroshi Maehara

Graphs Comb., 1990

1989

A Ramsey-Type Theorem for Orderings of a Graph.

[BibT_eX]

[DOI]

Peter Winkler

SIAM J. Discret. Math., 1989

Chromatically optimal rigid graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

Geometrical embeddings of graphs.

[BibT_eX]

[DOI]

Jan Reiterman

Discret. Math., 1989

The partite construction and ramsey set systems.

[BibT_eX]

[DOI]

Discret. Math., 1989

Percentages in pairwise balanced designs.

[BibT_eX]

[DOI]

Charles J. Colbourn

Discret. Math., 1989

Embeddings of Graphs in Euclidean Spaces.

[BibT_eX]

[DOI]

Jan Reiterman

Discret. Comput. Geom., 1989

1988

Tournament Ranking with Expected Profit in Polynomial Time.

[BibT_eX]

[DOI]

Joel Spencer

SIAM J. Discret. Math., 1988

The number of submatrices of a given type in a Hadamard matrix and related results.

[BibT_eX]

[DOI]

Richard M. Wilson

J. Comb. Theory B, 1988

Quantitative theorems for regular systems of equations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Embedding of trees in euclidean spaces.

[BibT_eX]

[DOI]

Graphs Comb., 1988

Some Ramsey - Turán type results for hypergraphs.

[BibT_eX]

[DOI]

Comb., 1988

Graph Complexity.

[BibT_eX]

[DOI]

Petr Savický

Acta Informatica, 1988

1987

Local k-colorings of graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Induced restricted Ramsey theorems for spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

On subsets of abelian groups with no 3-term arithmetic progression.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

Multiple Optima in Local Search.

[BibT_eX]

[DOI]

Craig A. Tovey

J. Algorithms, 1987

Small Spaces with Large Point Character.

[BibT_eX]

[DOI]

Eur. J. Comb., 1987

A note on ranking functions.

[BibT_eX]

[DOI]

William T. Trotter

Discret. Math., 1987

1986

An elementary proof of the canonizing version of Gallai-Witt's theorem.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

J. Comb. Theory A, 1986

Note on decomposition of spheres in Hilbert spaces.

[BibT_eX]

[DOI]

David Preiss

J. Comb. Theory A, 1986

Finite union theorem with restrictions.

[BibT_eX]

[DOI]

Graphs Comb., 1986

On sets of integers with the Schur property.

[BibT_eX]

[DOI]

Graphs Comb., 1986

Coloring of universal graphs.

[BibT_eX]

[DOI]

Péter Komjáth

Graphs Comb., 1986

Large triangle-free subgraphs in graphs withoutK4.

[BibT_eX]

[DOI]

Graphs Comb., 1986

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

[BibT_eX]

[DOI]

Graphs Comb., 1986

On universality of graphs with uniformly distributed edges.

[BibT_eX]

[DOI]

Discret. Math., 1986

Coloring graphs with locally few colors.

[BibT_eX]

[DOI]

Discret. Math., 1986

Two lower bounds for branching programs

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

On color critical graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

J. Comb. Theory B, 1985

Canonizing Ordering Theorems for Hales Jewett Structures.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

On graphs with small subgraphs of large chromatic number.

[BibT_eX]

[DOI]

Graphs Comb., 1985

Note on a Ramsey-Turán type problem.

[BibT_eX]

[DOI]

Graphs Comb., 1985

Lower bounds for Turán's problem.

[BibT_eX]

[DOI]

Graphs Comb., 1985

On a Packing and Covering Problem.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

Near Perfect Coverings in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

Threshold hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1985

Two remarks on Ramsey's theorem.

[BibT_eX]

[DOI]

Discret. Math., 1985

On the use of senders in generalized ramsey theory for graphs.

[BibT_eX]

[DOI]

Stefan A. Burr

Discret. Math., 1985

Geometrical Realization of Set Systems and Probabilistic Communication Complexity

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

On the minimum order of graphs with given semigroup.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

On combinatorial properties of spheres in eulidean spaces.

[BibT_eX]

[DOI]

Comb., 1984

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

[BibT_eX]

[DOI]

Kevin T. Phelps

Comb., 1984

Sparse Ramsey graphs.

[BibT_eX]

[DOI]

Comb., 1984

Hypergraphs do not jump.

[BibT_eX]

[DOI]

Comb., 1984

1983

On a product dimension of bipartite graphs.

[BibT_eX]

[DOI]

Ales Pultr

J. Graph Theory, 1983

Ramsey Classes of Set Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Another Proof of the Folkman-Rado-Sanders Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

The Ramsey number of a graph with bounded maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

On a problem in combinatorial geometry.

[BibT_eX]

[DOI]

Discret. Math., 1983

On qualitatively independent partitions and related problems.

[BibT_eX]

[DOI]

Ales Pultr

Discret. Appl. Math., 1983

1982

Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1982

Partition theorems for systems of finite subsets of integers.

[BibT_eX]

[DOI]

Discret. Math., 1982

Colouring steiner quadruple systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

Nearly bipartite graphs with large chromatic number.

[BibT_eX]

[DOI]

Comb., 1982

Monotone paths in ordered graphs.

[BibT_eX]

[DOI]

Vladimír Müller

Comb., 1982

1981

On the arc-chromatic number of a digraph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

On set systems determined by intersections.

[BibT_eX]

[DOI]

Discret. Math., 1981

Complexity of representation of graphs by set systems.

[BibT_eX]

[DOI]

Daniel Turzík

Discret. Appl. Math., 1981

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

[BibT_eX]

[DOI]

Comb., 1981

Fast Recognition of Rings and Lattices.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1979

A short proof of the existence of highly chromatic hypergraphs without short cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

1978

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

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

Partitions of Finite Relational and Set Systems.

[BibT_eX]

[DOI]