Vojtěch Rödl

From MaRDI portal
Revision as of 16:07, 7 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vojtěch Rödl to Vojtěch Rödl: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:168591

Available identifiers

zbMath Open rodl.vojtechDBLPr/VojtechRodlWikidataQ2484840 ScholiaQ2484840MaRDI QIDQ168591

List of research outcomes

PublicationDate of PublicationType
Colouring versus density in integers and Hales-Jewett cubes2023-11-14Paper
The girth Ramsey theorem2023-08-29Paper
On quantitative aspects of a canonisation theorem for edge‐orderings2023-08-22Paper
Colorful Matchings2023-06-14Paper
A blurred view of Van der Waerden type theorems2023-03-31Paper
Ramsey-type numbers involving graphs and hypergraphs with large girth2023-03-30Paper
On the Ramsey number of daisies I2022-11-18Paper
Extractors for small zero-fixing sources2022-11-09Paper
Every Steiner triple system contains almost spanning \(d\)-ary hypertree2022-08-04Paper
Covering the edges of a random hypergraph by cliques2022-07-26Paper
Some results and problems on clique coverings of hypergraphs2022-06-03Paper
Independent sets in subgraphs of a shift graph2022-04-04Paper
https://portal.mardi4nfdi.de/entity/Q50284382022-02-09Paper
A note on the induced Ramsey theorem for spaces2021-12-25Paper
On strong Sidon sets of integers2021-07-14Paper
Increasing paths in countable graphs2021-07-14Paper
On Hamiltonian cycles in hypergraphs with dense link graphs2021-07-06Paper
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs2021-01-25Paper
On local Turán problems2020-10-07Paper
https://portal.mardi4nfdi.de/entity/Q32982082020-07-21Paper
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs2019-10-17Paper
Packing Paths in Steiner Triple Systems2019-09-16Paper
A note on weak delta systems2019-09-11Paper
https://portal.mardi4nfdi.de/entity/Q46338302019-05-06Paper
The size Ramsey number of short subdivisions of bounded degree graphs2019-05-02Paper
Extractors for small zero-fixing sources2019-04-16Paper
Embedding hypertrees into steiner triple systems2019-03-27Paper
On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs2019-02-06Paper
Some Remarks on π2018-10-09Paper
Borsuk and Ramsey Type Questions in Euclidean Space2018-10-09Paper
Ramsey partial orders from acyclic graphs2018-07-27Paper
The Minimum Number of Edges in Uniform Hypergraphs with Property O2018-07-24Paper
An Algorithmic Hypergraph Regularity Lemma2018-07-16Paper
An algorithmic hypergraph regularity lemma2018-06-07Paper
On a Turán problem in weakly quasirandom 3-uniform hypergraphs2018-05-25Paper
The number of Bh‐sets of a given cardinality2018-04-10Paper
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs2018-04-06Paper
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs2018-03-16Paper
The complexity of proving that a graph is Ramsey2018-03-16Paper
A Note on Induced Ramsey Numbers2018-02-26Paper
A short proof of Erdős' conjecture for triple systems2018-02-22Paper
An exponential-type upper bound for Folkman numbers2018-02-12Paper
Infinite Sidon Sets Contained in Sparse Random Sets of Integers2018-02-07Paper
Statistics of orderings2018-01-05Paper
Note on a Ramsey theorem for posets with linear extensions2017-12-12Paper
A Ramsey class for Steiner systems2017-11-09Paper
https://portal.mardi4nfdi.de/entity/Q53712082017-10-25Paper
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions2017-10-04Paper
On the Number ofBh-Sets2017-10-04Paper
https://portal.mardi4nfdi.de/entity/Q53650342017-09-29Paper
On the Size‐Ramsey Number of Hypergraphs2017-09-26Paper
Hedgehogs are not colour blind2017-09-20Paper
Ramsey properties of random graphs and folkman numbers2017-07-17Paper
On the Hamiltonicity of triple systems with high minimum degree2017-04-12Paper
The chromatic number of finite type-graphs2016-11-25Paper
Discrepancy and eigenvalues of Cayley graphs2016-10-26Paper
Ramsey-type numbers involving graphs and hypergraphs with large girth2016-10-17Paper
Packing minor closed families of graphs2016-10-14Paper
Embedding tetrahedra into quasirandom hypergraphs2016-10-12Paper
Isomorphic edge disjoint subgraphs of hypergraphs2016-07-25Paper
The number of \(B_3\)-sets of a given cardinality2016-05-18Paper
Packing minor-closed families of graphs into complete graphs2016-04-21Paper
Hypergraph Ramsey numbers: tight cycles versus cliques2016-02-22Paper
On induced Ramsey numbers fork-uniform hypergraphs2016-02-03Paper
A short proof of the induced Ramsey theorem for hypergraphs2015-12-17Paper
A note on supersaturated set systems2015-09-30Paper
Modified ranks of tensors and the size of circuits2015-05-07Paper
An improved upper bound on the density of universal random graphs2015-04-09Paper
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers2015-02-20Paper
On generalized Ramsey numbers of Erdős and Rogers2014-10-22Paper
Degree Ramsey numbers of closed blowups of trees2014-09-04Paper
Note on upper density of quasi-random hypergraphs2014-08-14Paper
On generalized shift graphs2014-06-12Paper
Extremal Results in Random Graphs2014-05-19Paper
Families of triples with high minimum degree are Hamiltonian2014-05-16Paper
Note on the point character of \(\ell_1\)-spaces2014-05-05Paper
Some recent results on Ramsey-type numbers2013-11-29Paper
Maximal independent sets in the covering graph of the cube2013-11-29Paper
Specified intersections2013-11-14Paper
Hereditary quasi-random properties of hypergraphs2013-10-10Paper
Jumps and Nonjumps in Multigraphs2013-09-26Paper
The complexity of proving that a graph is Ramsey2013-08-06Paper
Tree-minimal graphs are almost regular2013-07-12Paper
Colorful Flowers2013-06-28Paper
Complete Partite subgraphs in dense hypergraphs2012-12-14Paper
Distance Preserving Ramsey Graphs2012-09-04Paper
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma2012-08-22Paper
Universality of Random Graphs2012-08-22Paper
On induced Folkman numbers2012-08-14Paper
An Improved Upper Bound on the Density of Universal Random Graphs2012-06-29Paper
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels2012-06-04Paper
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size2012-05-14Paper
On Even-Degree Subgraphs of Linear Hypergraphs2012-05-14Paper
On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers2011-12-20Paper
Hereditary quasirandom properties of hypergraphs2011-12-20Paper
A note on Thomassen's conjecture2011-12-08Paper
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma2011-08-17Paper
On a conjecture of Thomassen concerning subgraphs of large girth2011-08-16Paper
Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs2011-06-14Paper
https://portal.mardi4nfdi.de/entity/Q30014082011-05-31Paper
Sparse partition universal graphs for graphs of bounded degree2011-03-29Paper
https://portal.mardi4nfdi.de/entity/Q30838772011-03-23Paper
https://portal.mardi4nfdi.de/entity/Q30782082011-02-18Paper
https://portal.mardi4nfdi.de/entity/Q30782142011-02-18Paper
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions2011-01-17Paper
On the Function of Erdős and Rogers2010-12-20Paper
Ramsey properties of random discrete structures2010-12-14Paper
https://portal.mardi4nfdi.de/entity/Q30608632010-12-13Paper
https://portal.mardi4nfdi.de/entity/Q30608652010-12-13Paper
Maximal independent sets in bipartite graphs obtained from Boolean lattices2010-11-22Paper
Constructions of sparse uniform hypergraphs with high chromatic number2010-11-10Paper
Generalizations of the removal lemma2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35794962010-08-06Paper
Note on asymptotically good packings2010-07-13Paper
https://portal.mardi4nfdi.de/entity/Q35687122010-06-15Paper
Some constructive bounds on Ramsey numbers2010-06-03Paper
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles2010-04-23Paper
A Note on Universal and Canonically Coloured Sequences2010-04-22Paper
On Colourings of Hypergraphs Without Monochromatic Fano Planes2010-04-22Paper
An almost quadratic bound on vertex Folkman numbers2010-04-21Paper
Weak hypergraph regularity and linear hypergraphs2010-04-21Paper
On the number of graphs with a given endomorphism monoid2010-03-29Paper
Note on robust critical graphs with large odd girth2010-03-29Paper
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness2010-01-27Paper
On graphs with a given endomorphism monoid2009-12-18Paper
On \(k\)-chromatically connected graphs2009-12-15Paper
REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS2009-09-28Paper
Perfect matchings in large uniform hypergraphs with large minimum collective degree2009-06-17Paper
On Ramsey Minimal Graphs2009-05-27Paper
On the Ramsey number of sparse 3-graphs2009-05-08Paper
Colorful flowers2009-04-23Paper
Some recollections on early work with Jan Pelant2009-04-23Paper
On the Turán properties of infinite graphs2009-04-07Paper
Triangulations and the Hajós conjecture2009-02-20Paper
Cliques in Steiner systems2009-02-09Paper
https://portal.mardi4nfdi.de/entity/Q35496482009-01-05Paper
An Algorithmic Version of the Hypergraph Regularity Method2008-12-22Paper
On the Folkman Numberf(2, 3, 4)2008-12-18Paper
An approximate Dirac-type theorem for \(k\)-uniform hypergraphs2008-10-21Paper
Note on the 3-graph counting Lemma2008-09-04Paper
Finding Folkman Numbers via MAX CUT Problem2008-06-05Paper
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs2008-05-22Paper
The hypergraph regularity method and its applications2008-05-07Paper
New Upper Bound on Vertex Folkman Numbers2008-04-15Paper
Every Monotone 3‐Graph Property is Testable2008-03-28Paper
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions2007-11-28Paper
Essentially infinite colourings of hypergraphs2007-11-27Paper
Measures of pseudorandomness for finite sequences: typical values2007-11-27Paper
Regular Partitions of Hypergraphs: Regularity Lemmas2007-11-22Paper
Regular Partitions of Hypergraphs: Counting Lemmas2007-11-22Paper
Density theorems and extremal hypergraph problems2007-10-09Paper
Every Monotone 3-Graph Property is Testable2007-05-29Paper
Turán's theorem for pseudo-random graphs2007-05-10Paper
Integer and fractional packings in dense graphs2007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34248862007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34248922007-03-05Paper
A note on the jumping constant conjecture of Erdős2007-02-13Paper
Integer and fractional packings of hypergraphs2007-02-13Paper
Small subsets inherit sparse \(\varepsilon\)-regularity2007-01-11Paper
On the chromatic number and independence number of hypergraph products2007-01-11Paper
Supersaturation for Ramsey-Turán problems2007-01-08Paper
On Ramsey numbers of uniform hypergraphs with given maximum degree2006-12-07Paper
Perfect matchings in uniform hypergraphs with large minimum degree2006-11-15Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Color critical hypergraphs with many edges2006-09-12Paper
A note on a conjecture by Füredi2006-08-17Paper
Short paths in quasi-random triple systems with sparse underlying graphs2006-07-12Paper
Sharp bounds for some multicolour Ramsey numbers2006-06-27Paper
The counting lemma for regular k‐uniform hypergraphs2006-05-16Paper
Applications of the regularity lemma for uniform hypergraphs2006-05-16Paper
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring2006-03-21Paper
The Ramsey number for hypergraph cycles. I.2006-03-16Paper
Measures of Pseudorandomness for Finite Sequences: Minimal Values2006-03-13Paper
A Dirac-Type Theorem for 3-Uniform Hypergraphs2006-03-13Paper
On Cover Graphs and Dependent Arcs in Acyclic Orientations2005-10-18Paper
https://portal.mardi4nfdi.de/entity/Q54653632005-08-22Paper
On graphs with small Ramsey numbers. II.2005-07-05Paper
Counting Small Cliques in 3-uniform Hypergraphs2005-06-07Paper
Counting subgraphs in quasi‐random 4‐uniform hypergraphs2005-04-21Paper
Distance Graphs on the Integers2005-04-04Paper
Ramsey Games Against a One-Armed Bandit2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q48289442004-11-29Paper
Embedding graphs with bounded degree in sparse pseudorandom graphs2004-11-11Paper
Strong Ramsey properties of simplices2004-11-11Paper
Uniform edge distribution in hypergraphs is hereditary2004-10-13Paper
The Turn Theorem for Random Graphs2004-09-07Paper
Regularity Lemma for k-uniform hypergraphs2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q47372282004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44534522004-03-07Paper
On large intersecting subfamilies of uniform setfamilies2004-02-03Paper
Hereditary Properties of Triple Systems2004-01-07Paper
Proof of a hypercontractive estimate via entropy2003-11-26Paper
https://portal.mardi4nfdi.de/entity/Q44074522003-11-05Paper
Regularity properties for triple systems2003-10-22Paper
An Optimal Algorithm for Checking Regularity2003-09-28Paper
Independent Deuber sets in graphs on the natural numbers2003-09-07Paper
Ramsey properties of families of graphs2003-08-20Paper
Regular pairs in sparse random graphs I2003-07-31Paper
On homogeneous sets of positive integers2003-05-27Paper
Integer and fractional packings in dense 3‐uniform hypergraphs2003-05-11Paper
On the Turán number of triple systems2003-03-26Paper
On characterizing hypergraph regularity2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q47807922002-11-21Paper
On graphs with small Ramsey numbers*2002-10-01Paper
Extremal problems on set systems2002-08-08Paper
Hypergraphs, quasi-randomness, and conditions for regularity2002-07-04Paper
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma2002-04-23Paper
On bipartite graphs with linear Ramsey numbers2002-02-13Paper
On the chromatic number of set systems2002-02-10Paper
Holes in graphs2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q43862992001-12-04Paper
On graphs with linear Ramsey numbers2001-07-23Paper
The asymptotic number of triple systems not containing a fixed one2001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45083622001-04-17Paper
Independent arithmetic progressions in clique-free graphs on the natural numbers2001-04-17Paper
On size Ramsey numbers of graphs with bounded degree2001-04-01Paper
An Algorithmic Regularity Lemma for Hypergraphs2000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q45083582000-10-03Paper
Non-Ramsey graphs are \(c\log n\)-universal2000-04-09Paper
Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma2000-02-21Paper
Extremal problems for sets forming Boolean algebras and complete partite hypergraphs2000-01-31Paper
On Systems of Small Sets with No Large Δ-Subsystems2000-01-11Paper
Hypergraph Packing and Graph Embedding2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q47053471999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q42471951999-12-13Paper
https://portal.mardi4nfdi.de/entity/Q42691741999-10-31Paper
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles1999-07-07Paper
Constructive Quasi-Ramsey Numbers and Tournament Ranking1999-06-27Paper
On large systems of sets with no large weak \(\Delta\)-subsystems1999-05-18Paper
Induced Ramsey numbers1999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42303721999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q42175851999-03-02Paper
Endomorphisms of Partially Ordered Sets1998-08-20Paper
Ramsey properties of random hypergraphs1998-08-02Paper
Bipartite Coverings of Graphs1998-07-29Paper
Extremal Problems for Affine Cubes of Integers1998-07-27Paper
Independent finite sums in graphs defined on the natural numbers1998-06-24Paper
On \(K^ 4\)-free subgraphs of random graphs1998-05-06Paper
Perfect matchings in \(\varepsilon\)-regular graphs1998-03-05Paper
On the size of set systems on \([n\) not containing weak \((r,\Delta)\)-systems]1998-02-01Paper
On Schur properties of random subsets of integers1998-01-14Paper
Chromatic Ramsey theory1997-08-18Paper
Rado Partition Theorem for Random Subsets of Integers1997-07-07Paper
Boolean Circuits, Tensor Ranks, and Communication Complexity1997-05-26Paper
Arithmetic progressions of length three in subsets of a random set1997-03-25Paper
https://portal.mardi4nfdi.de/entity/Q56890121997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q52841001997-03-09Paper
Note on regular subgraphs1997-02-20Paper
On induced Ramsey numbers for graphs with bounded maximum degree1997-01-26Paper
https://portal.mardi4nfdi.de/entity/Q48791591996-11-10Paper
Onp-intersection representations1996-11-03Paper
Applications of hypergraph coloring to coloring graphs not inducing certain trees1996-09-01Paper
Ramsey families which exclude a graph1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48869281996-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48852221996-07-15Paper
https://portal.mardi4nfdi.de/entity/Q48818521996-07-14Paper
Multicolored subsets in colored hypergraphs1996-07-09Paper
Threshold Functions for Ramsey Properties1996-05-29Paper
Graphs of small dimensions1996-05-14Paper
The complexity of cover graph recognition for some varieties of finite lattices1996-05-05Paper
https://portal.mardi4nfdi.de/entity/Q48738301996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48736701996-04-17Paper
On the computational complexity of ordered subgraph recognition1996-03-05Paper
https://portal.mardi4nfdi.de/entity/Q48525541995-11-01Paper
On uncrowded hypergraphs1995-10-05Paper
Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)1995-09-28Paper
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph1995-07-26Paper
The minimum independence number for designs1995-07-24Paper
On the jumping constant conjecture for multigraphs1995-07-23Paper
Extremal problems for triple systems1995-07-11Paper
Dense graphs without 3-regular subgraphs1995-07-02Paper
On Erdős-Rado numbers1995-06-08Paper
Coverings of r—graphs by complete r—partite subgraphs1995-05-28Paper
On Ramsey sets in spheres1995-04-04Paper
Complexity of diagrams1995-02-16Paper
Some combinatorial-algebraic problems from complexity theory1995-02-13Paper
On the genus of a random graph1995-02-09Paper
On canonical Ramsey numbers for complete graphs versus paths1994-08-28Paper
Note on independent sets in steiner systems1994-08-10Paper
The Erdős-Ko-Rado theorem for small families1994-07-12Paper
Unbalanced Steiner triple systems1994-06-08Paper
Finite induced graph Ramsey theory: On partitions of subgraphs1994-06-06Paper
The Algorithmic Aspects of the Regularity Lemma1994-06-05Paper
Monochromatic trees with respect to edge partitions1994-05-24Paper
Random graphs with monochromatic triangles in every edge coloring1994-05-08Paper
https://portal.mardi4nfdi.de/entity/Q31371881994-04-13Paper
Corrigendum to: `Complexity of diagrams'1994-04-12Paper
https://portal.mardi4nfdi.de/entity/Q42846241994-03-24Paper
On isomorphic subgraphs1994-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31371691993-11-01Paper
2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs1993-10-24Paper
Rigid linear binary codes1993-05-23Paper
Enumeration of order preserving maps1993-04-01Paper
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs1993-04-01Paper
The uniformity lemma for hypergraphs1993-04-01Paper
Monochromatic vs multicolored paths1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40285001993-03-28Paper
On embedding of graphs into Euclidean spaces of small dimension1993-03-10Paper
Coloring Ordered Sets to Avoid Monochromatic Maximal Chains1993-01-17Paper
On coverings of infinite-dimensional metric spaces1993-01-17Paper
Cycle-connected graphs1993-01-17Paper
A Canonical Ramsey Theorem1993-01-16Paper
A combinatorial approach to complexity1993-01-16Paper
On Ramsey graphs without bipartite subgraphs1993-01-16Paper
The Ramsey Property for Families of Graphs Which Exclude a Given Graph1993-01-12Paper
https://portal.mardi4nfdi.de/entity/Q40143071992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q40112481992-09-27Paper
Rainbow subgraphs in properly edge‐colored graphs1992-06-28Paper
The number of \(t\)-wise balanced designs1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39727541992-06-26Paper
Embeddings of graphs in Euclidean spaces1992-06-25Paper
Iterated combinatorial density theorems1992-06-25Paper
Quantitative versions of combinatorial partition theorems.1992-06-25Paper
Monochromatic solutions to equations with unit fractions1991-01-01Paper
A Ramsey type problem concerning vertex colourings1991-01-01Paper
On the dimension to represent a graph by a unit distance graph1990-01-01Paper
Lower bounds to the complexity of symmetric Boolean functions1990-01-01Paper
On Ramsey families of sets1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022241990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33489661990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33563191990-01-01Paper
A Partition Property of Simplices in Euclidean Space1990-01-01Paper
Percentages in pairwise balanced designs1989-01-01Paper
The partite construction and Ramsey set systems1989-01-01Paper
Chromatically optimal rigid graphs1989-01-01Paper
A Ramsey-Type Theorem for Orderings of a Graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746541989-01-01Paper
Geometrical embeddings of graphs1989-01-01Paper
Embedding of trees in Euclidean spaces1988-01-01Paper
Quantitative theorems for regular systems of equations1988-01-01Paper
Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. I1988-01-01Paper
Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. II1988-01-01Paper
The number of submatrices of a given type in a Hadamard matrix and related results1988-01-01Paper
Some Ramsey-Turán type results for hypergraphs1988-01-01Paper
Tournament Ranking with Expected Profit in Polynomial Time1988-01-01Paper
Graph complexity1988-01-01Paper
Induced restricted Ramsey theorems for spaces1987-01-01Paper
On subsets of abelian groups with no 3-term arithmetic progression1987-01-01Paper
A note on ranking functions1987-01-01Paper
Small spaces with large point character1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47262901987-01-01Paper
Forbidden Intersections1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37658131987-01-01Paper
Strong Ramsey Theorems for Steiner Systems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705731987-01-01Paper
An elementary proof of the canonizing version of Gallai-Witt's theorem1986-01-01Paper
Coloring of universal graphs1986-01-01Paper
Coloring graphs with locally few colors1986-01-01Paper
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent1986-01-01Paper
Large triangle-free subgraphs in graphs without \(K_ 4\)1986-01-01Paper
Note on decomposition of spheres in Hilbert spaces1986-01-01Paper
On hereditarily rigid algebras1986-01-01Paper
On universality of graphs with uniformly distributed edges1986-01-01Paper
Finite union theorem with restrictions1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30270241986-01-01Paper
All Triangles are Ramsey1986-01-01Paper
On sets of integers with the Schur property1986-01-01Paper
On the use of senders in generalized Ramsey theory for graphs1985-01-01Paper
Threshold hypergraphs1985-01-01Paper
On a packing and covering problem1985-01-01Paper
On color critical graphs1985-01-01Paper
Two remarks on Ramsey's theorem1985-01-01Paper
Lower bounds for Turán's problem1985-01-01Paper
On graphs with small subgraphs of large chromatic number1985-01-01Paper
Canonizing ordering theorems for Hales Jewett structures1985-01-01Paper
Note on a Ramsey-Turán type problem1985-01-01Paper
Near perfect coverings in graphs and hypergraphs1985-01-01Paper
Two Proofs in Combinatorial Number Theory1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36919501985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374661985-01-01Paper
On combinatorial properties of spheres in euclidean spaces1984-01-01Paper
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems1984-01-01Paper
On the minimum order of graphs with given semigroup1984-01-01Paper
How to build a barricade1984-01-01Paper
Sparse Ramsey graphs1984-01-01Paper
Combinatorial partitions of finite posets and lattices - Ramsey lattices1984-01-01Paper
Hypergraphs do not jump1984-01-01Paper
Block Sizes in Pairwise Balanced Designs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33396571984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33479171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867521984-01-01Paper
The Ramsey number of a graph with bounded maximum degree1983-01-01Paper
On qualitatively independent partitions and related problems1983-01-01Paper
Ramsey classes of set systems1983-01-01Paper
On classes of graphs determined by forbidden subgraphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33171481983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33257611983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33312501983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36720421983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39560741983-01-01Paper
On a problem in combinatorial geometry1983-01-01Paper
Another proof of the Folkman-Rado-Sanders theorem1983-01-01Paper
Monotone paths in ordered graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36712221982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569921982-01-01Paper
Coloring Block Designs is NP-Complete1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39630271982-01-01Paper
Coloring Steiner Triple Systems1982-01-01Paper
Colouring Steiner quadruple systems1982-01-01Paper
Partition theorems for systems of finite subsets of integers1982-01-01Paper
Two proofs of the Ramsey property of the class of finite hypergraphs1982-01-01Paper
Nearly bipartite graphs with large chromatic number1982-01-01Paper
On the arc-chromatic number of a digraph1981-01-01Paper
Complexity of representation of graphs by set systems1981-01-01Paper
On set systems determined by intersections1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190771981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39212581981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330301981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414371981-01-01Paper
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38864921980-01-01Paper
Orthogonal partitions and covering of graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38597891979-01-01Paper
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709351979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38725051979-01-01Paper
A short proof of the existence of highly chromatic hypergraphs without short cycles1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545841978-01-01Paper
Selective Graphs and Hypergraphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41686411978-01-01Paper
On a Probabilistic Graph-Theoretical Method1978-01-01Paper
The structure of critical Ramsey graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964611978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42001011978-01-01Paper
The structure of critical Ramsey graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38946391978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39006591978-01-01Paper
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph1978-01-01Paper
A structural generalization of the Ramsey theorem1977-01-01Paper
On critical 3-chromatic hypergraphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41659071977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41825381977-01-01Paper
On the Chromatic Number of Subgraphs of a Given Graph1977-01-01Paper
Partitions of finite relational and set systems1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116181976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41139061976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41339871976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41339881976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41035701976-01-01Paper
The Ramsey property for graphs with forbidden complete subgraphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40631871975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888551975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888561975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40988941975-01-01Paper
Representing groups and semigroups by products in categories of relations1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56729261973-01-01Paper
Tur\'an density of cliques of order five in $3$-uniform hypergraphs with quasirandom links0001-01-03Paper
Colorings of $k$-sets with low discrepancy on small sets0001-01-03Paper
Note on set representation of bounded degree hypergaphs0001-01-03Paper
Nowhere dense Ramsey sets0001-01-03Paper
The $k$-representation number of the random graph0001-01-03Paper

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: Vojtěch Rödl