Vojtěch Rödl

Q: What Schools Are Affiliated With Vojtěch Rödl

Vojtěch Rödl is affiliated with the following schools: Emory University, Charles University, University of São Paulo

Vojtěch Rödl's AcademicInfluence.com Rankings

Vojtěch Rödl

Mathematics

#684

World Rank

#1256

Historical Rank

#300

USA Rank

Combinatorics

#14

World Rank

#18

Historical Rank

USA Rank

Graph Theory

#33

World Rank

#40

Historical Rank

USA Rank

Measure Theory

#1030

World Rank

#1327

Historical Rank

#379

USA Rank

mathematics Degrees

Download Badge

Mathematics

Vojtěch Rödl's Degrees

PhD Mathematics Charles University

Why Is Vojtěch Rödl Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Vojtěch Rödl is a Czech American mathematician, Samuel Candler Dobbs Professor at Emory University. He is noted for his contributions mainly to combinatorics having authored hundreds of research papers.

(See a Problem?)

Vojtěch Rödl's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On a Packing and Covering Problem (1985) (392)
The algorithmic aspects of the regularity lemma (1992) (334)
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (1986) (291)
Regularity Lemma for k‐uniform hypergraphs (2004) (267)
A Dirac-Type Theorem for 3-Uniform Hypergraphs (2006) (228)
The counting lemma for regular k‐uniform hypergraphs (2006) (222)
Extremal problems on set systems (2002) (187)
Threshold functions for Ramsey properties (1995) (184)
Partitions of Finite Relational and Set Systems (1977) (182)
The Ramsey number of a graph with bounded maximum degree (1983) (180)
Near Perfect Coverings in Graphs and Hypergraphs (1985) (157)
The Ramsey property for graphs with forbidden complete subgraphs (1976) (154)
Hypergraphs do not jump (1984) (153)
On universality of graphs with uniformly distributed edges (1986) (146)
An approximate Dirac-type theorem for k-uniform hypergraphs (2008) (142)
Perfect matchings in large uniform hypergraphs with large minimum collective degree (2009) (140)
Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) (2010) (133)
Regular Partitions of Hypergraphs: Regularity Lemmas (2007) (119)
Applications of the regularity lemma for uniform hypergraphs (2006) (119)
Large triangle-free subgraphs in graphs withoutK4 (1986) (116)
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels (2011) (115)
Ramsey Classes of Set Systems (1983) (111)
Geometrical realization of set systems and probabilistic communication complexity (1985) (108)
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (1995) (106)
The counting lemma for regular k-uniform hypergraphs (2006) (103)
Arithmetic progressions of length three in subsets of a random set (1996) (98)
Szemerédi’s Regularity Lemma and Quasi-randomness (2003) (98)
The Uniformity Lemma for hypergraphs (1992) (94)
Hypergraphs, Quasi-randomness, and Conditions for Regularity (2002) (91)
Integer and Fractional Packings in Dense Graphs (2001) (90)
A short proof of the existence of highly chromatic hypergraphs without short cycles (1979) (84)
Combinatorial partitions of finite posets and lattices —Ramsey lattices (1984) (78)
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (1998) (77)
Two lower bounds for branching programs (1986) (77)
Weak hypergraph regularity and linear hypergraphs (2010) (77)
On Uncrowded Hypergraphs (1995) (76)
Perfect matchings in uniform hypergraphs with large minimum degree (2006) (72)
Boolean Circuits, Tensor Ranks, and Communication Complexity (1997) (71)
The partite construction and ramsey set systems (1989) (71)
On the arc-chromatic number of a digraph (1981) (70)
Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs (2011) (69)
On graphs with linear Ramsey numbers (2000) (69)
Regular Partitions of Hypergraphs: Counting Lemmas (2007) (68)
Measures of pseudorandomness for finite sequences: typical values (2007) (68)
Mathematics of Ramsey Theory (1991) (67)
Random Graphs with Monochromatic Triangles in Every Edge Coloring (1994) (67)
Partition theorems for systems of finite subsets of integers (1982) (66)
On subsets of abelian groups with no 3-term arithmetic progression (1987) (65)
Coloring graphs with locally few colors (1986) (65)
A partition property of simplices in Euclidean space (1990) (64)
Generalizations of the removal lemma (2009) (63)
OnK4-free subgraphs of random graphs (1997) (63)
On graphs with small subgraphs of large chromatic number (1985) (62)
Sharp Bounds For Some Multicolor Ramsey Numbers (2005) (62)
On the Turán Number of Triple Systems (2002) (61)
Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma (1999) (61)
On Size Ramsey Numbers of Graphs with Bounded Degree (2000) (61)
Quantitative theorems for regular systems of equations (1988) (60)
Regular pairs in sparse random graphs I (2003) (60)
Ramsey Games Against a One-Armed Bandit (2003) (58)
The Ramsey number for hypergraph cycles I (2006) (57)
The hypergraph regularity method and its applications. (2005) (57)
Ramsey properties of random discrete structures (2010) (56)
On a probabilistic graph-theoretical method (1978) (56)
On graphs with small Ramsey numbers * (2001) (56)
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (2007) (53)
Simple proof of the existence of restricted ramsey graphs by means of a partite construction (1981) (53)
On Schur Properties of Random Subsets of Integers (1996) (53)
Extremal Hypergraph Problems and the Regularity Method (2006) (52)
Small subsets inherit sparse ε-regularity (2004) (50)
Sparse partition universal graphs for graphs of bounded degree (2011) (50)
The number of submatrices of a given type in a Hadamard matrix and related results (1988) (50)
Regularity Lemmas for Graphs (2010) (49)
Chromatically optimal rigid graphs (1989) (49)
An Optimal Algorithm for Checking Regularity (2003) (47)
Universality and tolerance (2000) (46)
Note on Independent Sets in Steiner Systems (1994) (45)
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (2012) (44)
Regularity properties for triple systems (2003) (44)
The Turán Theorem for Random Graphs (2004) (43)
The asymptotic number of triple systems not containing a fixed one (2001) (42)
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring (2003) (42)
Rainbow Subgraphs in Properly Edge-colored Graphs (1992) (42)
Dense Graphs without 3-Regular Subgraphs (1995) (42)
On qualitatively independent partitions and related problems (1983) (41)
Asymptotic packing and the random greedy algorithm (1996) (41)
Lower Bounds to the Complexity of Symmetric Boolean Functions (1990) (40)
On Colourings of Hypergraphs Without Monochromatic Fano Planes (2009) (40)
Pseudorandom sets and explicit constructions of ramsey graphs (2004) (39)
A note on the jumping constant conjecture of Erdös (2007) (39)
On Bipartite Graphs with Linear Ramsey Numbers (2001) (39)
The structure of critical Ramsey graphs (1978) (38)
Coloring Steiner Triple Systems (1982) (38)
All triangles are Ramsey (1986) (37)
Some combinatorial-algebraic problems from complexity theory (1994) (37)
Induced Ramsey Numbers (1998) (37)
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (2016) (37)
An Algorithmic Regularity Lemma for Hypergraphs (2000) (37)
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (2015) (37)
On the chromatic number of set systems (2001) (36)
On the chromatic number of subgraphs of a given graph (1977) (36)
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs (1999) (36)
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers (2011) (36)
Holes in Graphs (2001) (36)
Local k-colorings of graphs and hypergraphs (1987) (34)
Non-Ramsey Graphs Are c log n-Universal (1999) (34)
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs (1993) (34)
Constructions of sparse uniform hypergraphs with high chromatic number (2010) (34)
A structural generalization of the Ramsey theorem (1977) (34)
Geometrical embeddings of graphs (1989) (33)
Ramsey Properties of Random Hypergraphs (1998) (33)
On the use of senders in generalized ramsey theory for graphs (1985) (32)
A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph (1978) (31)
Complexity of diagrams (1987) (31)
Measures of Pseudorandomness for Finite Sequences: Minimal Values (2006) (30)
On the Ramsey Number of Sparse 3-Graphs (2008) (29)
Complexity of representation of graphs by set systems (1981) (29)
Modified ranks of tensors and the size of circuits (1993) (29)
An improved upper bound on the density of universal random graphs (2012) (29)
On an anti-Ramsey type result (2002) (29)
On the Folkman Number f(2, 3, 4) (2008) (29)
Some Ramsey-Turán type results for hypergraphs (1988) (29)
Hereditary Properties of Triple Systems (2003) (29)
Property testing in hypergraphs and the removal lemma (2007) (29)
Near-optimum Universal Graphs for Graphs with Bounded Degrees (2001) (29)
Lower bounds for Turán's problem (1985) (28)
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles (2009) (28)
Hypergraph regularity and quasi-randomness (2009) (28)
Density theorems and extremal hypergraph problems (2006) (28)
Extremal Problems for Affine Cubes of Integers (1998) (28)
Hypergraph Packing and Graph Embedding (1999) (27)
Shift graphs and lower bounds on Ramsey numbers rk(l; r) (1995) (27)
A note on perfect matchings in uniform hypergraphs with large minimum collective degree (2008) (27)
Efficient Testing of Hypergraphs (2002) (26)
Perfect Matchings in ε-regular Graphs (1998) (26)
Threshold hypergraphs (1985) (26)
On Erdős-Rado numbers (1995) (26)
Extremal problems for triple systems (1993) (25)
A combinatorial approach to complexity (1992) (25)
An algorithmic version of the hypergraph regularity method (2005) (25)
The minimum independence number for designs (1995) (25)
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs (2007) (25)
Constructive Quasi-Ramsey Numbers and Tournament Ranking (1999) (24)
Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs (1982) (24)
Applications of hypergraph coloring to coloring graphs not inducing certain trees (1996) (24)
Small subsets inherit sparse epsilon-regularity (2007) (24)
Partial Steiner systems and matchings in hypergraphs (1998) (23)
Tournament Ranking with Expected Profit in Polynomial Time (1988) (23)
On Graphs With Small Ramsey Numbers, II (2004) (23)
On Ramsey numbers of uniform hypergraphs with given maximum degree (2006) (23)
On Canonical Ramsey Numbers for Complete Graphs versus Paths (1993) (23)
Induced restricted Ramsey theorems for spaces (1987) (22)
MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES (2003) (22)
Embedding tetrahedra into quasirandom hypergraphs (2016) (22)
Every Monotone 3-Graph Property is Testable (2005) (22)
On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems (1984) (22)
Packing minor-closed families of graphs into complete graphs (2016) (22)
A Ramsey-Type Theorem for Orderings of a Graph (1989) (22)
On Ramsey Sets in Spheres (1995) (21)
Multicolored Subsets in Colored Hypergraphs (1996) (20)
On generalized Ramsey numbers of Erdős and Rogers (2014) (20)
Universality of random graphs (2008) (20)
Integer and fractional packings of hypergraphs (2007) (20)
Some constructive bounds on Ramsey numbers (2010) (20)
On characterizing hypergraph regularity (2002) (19)
On graphs with small Ramsey numbers (2001) (19)
Families of triples with high minimum degree are hamiltonian (2014) (19)
Sparse ramsey graphs (1984) (19)
Monochromatic Vs multicolored paths (1992) (19)
Canonizing Ordering Theorems for Hales Jewett Structures (1985) (19)
Graph complexity (1988) (19)
On embedding of graphs into euclidean spaces of small dimension (1992) (18)
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs (2017) (18)
An almost quadratic bound on vertex Folkman numbers (2010) (18)
Coloring of universal graphs (1986) (18)
THE RAMSEY NUMBER FOR HYPERGRAPH CYCLES II (2007) (18)
On the dimension to represent a graph by a unit distance graph (1990) (17)
Partite Construction and Ramsey Space Systems (1990) (17)
Products of graphs and their applications (1983) (17)
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree (1996) (16)
On isomorphic subgraphs (1993) (16)
A ramsey type problem concerning vertex colourings (1991) (16)
On the minimum order of graphs with given semigroup (1984) (16)
Integer and fractional packings in dense 3‐uniform hypergraphs (2003) (15)
Multiple Optima in Local Search (1987) (15)
Turán's theorem for pseudo-random graphs (2007) (15)
Counting subgraphs in quasi‐random 4‐uniform hypergraphs (2005) (15)
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs (1992) (15)
On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs (2010) (14)
Graphs of small dimensions (1996) (14)
Distance Graphs on the Integers (2005) (14)
An exponential-type upper bound for Folkman numbers (2016) (14)
On the function of Erdős and Rogers (2011) (14)
On the Jumping Constant Conjecture for Multigraphs (1995) (14)
The complexity of proving that a graph is Ramsey (2013) (14)
Arrangeability and Clique Subdivisions (2013) (14)
Ultrafilters on ω and atoms in the lattice of uniformities II (1988) (14)
On Ramsey graphs without cycles of short odd lengths (1979) (13)
On ramsey families of sets (1990) (13)
Maximal independent sets in bipartite graphs obtained from Boolean lattices (2011) (13)
A Canonical Ramsey Theorem (1992) (12)
Note on Upper Density of Quasi-Random Hypergraphs (2013) (12)
Finite union theorem with restrictions (1986) (12)
The size Ramsey number of short subdivisions of bounded degree graphs (2018) (12)
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) (1992) (12)
On Pisier Type Problems and Results (Combinatorial Applications to Number Theory) (1990) (12)
On color critical graphs (1985) (12)
Distance Preserving Ramsey Graphs (2012) (12)
On the Hamiltonicity of Triple Systems with High Minimum Degree (2016) (12)
Counting Small Cliques in 3-uniform Hypergraphs (2005) (12)
An elementary proof of the canonizing version of Gallai-Witt's theorem (1986) (12)
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers (2001) (12)
Proof of a hypercontractive estimate via entropy (2001) (12)
Two remarks on Ramsey's theorem (1985) (11)
Tree-minimal graphs are almost regular (2012) (11)
The number of sub-matrics of a given type in a Hadamard matrix and related results (1987) (11)
Short paths in quasi-random triple systems with sparse underlying graphs (2006) (10)
On the Size‐Ramsey Number of Hypergraphs (2015) (10)
On p -intersection representations (1996) (10)
Efficient testing of hypergraphs: (Extended abstract) (2002) (10)
New Upper Bound on Vertex Folkman Numbers (2008) (10)
Hereditary quasirandom properties of hypergraphs (2011) (10)
Coloring Uniform Hypergraphs with Small Edge Degrees (2010) (10)
On Ramsey Minimal Graphs (2008) (9)
The maximum size of a Sidon set contained in a sparse random set of integers (2011) (9)
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs (2018) (9)
Degree Ramsey Numbers of Closed Blowups of Trees (2014) (9)
Embedding of trees in euclidean spaces (1988) (9)
On Hamiltonian cycles in hypergraphs with dense link graphs (2020) (9)
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (2011) (9)
Discrepancy and eigenvalues of Cayley graphs (2016) (9)
A Ramsey class for Steiner systems (2016) (8)
Representing groups and semigroups by products in categories of relations (1974) (8)
On the Computational Complexity of Ordered Subgraph Recognition (1995) (8)
Unbalanced Steiner Triple Systems (1994) (8)
On the Number of Bh-Sets (2015) (8)
Selective Graphs and Hypergraphs (1978) (8)
Ramsey Partial Orders from Acyclic Graphs (2016) (8)
The number of Bh ‐sets of a given cardinality (2018) (8)
Note on the number of monoids of order $n$ (1985) (8)
Maximal independent sets in the covering graph of the cube (2013) (8)
Coloring Block Designs is NP-Complete (1982) (8)
Nearly bipartite graphs with large chromatic number (1982) (8)
Another Proof of the Folkman-Rado-Sanders Theorem (1983) (8)
On a conjecture of Thomassen concerning subgraphs of large girth (2011) (8)
On the Genus of a Random Graph (1995) (8)
On coverings of infinite- dimentional metric spaces (1992) (7)
On p-intersection representations (1996) (7)
Percentages in pairwise balanced designs (1989) (7)
Uniform Edge Distribution in Hypergraphs is Hereditary (2004) (7)
On the chromatic number and independence number of hypergraph products (2007) (7)
Independent Deuber sets in graphs on the natural numbers (2003) (7)
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions (2014) (7)
Note on a Ramsey-Turán type problem (1985) (7)
Algorithmic Aspects of Regularity (2000) (7)
A note on supersaturated set systems (2016) (7)
On Ramsey graphs without bipartite subgraphs (1992) (7)
Infinite Sidon Sets Contained in Sparse Random Sets of Integers (2018) (7)
Counting subgraphs in quasi-random 4-uniform hypergraphs (2005) (7)
Partite construction and Ramseyan theorems for sets, numbers and spaces (1987) (7)
On Cover Graphs and Dependent Arcs in Acyclic Orientations (2005) (7)
Fast Recognition of Rings and Lattices (1981) (7)
On Even-Degree Subgraphs of Linear Hypergraphs (2012) (7)
The number oft-wise balanced designs (1991) (7)
Independent finite sums in graphs defined on the natural numbers (1998) (7)
Complete Partite subgraphs in dense hypergraphs (2012) (7)
Small Spaces with Large Point Character (1987) (7)
The Ramsey Property for Families of Graphs Which Exclude a Given Graph (1992) (7)
On the Turán Properties of Infinite Graphs (2008) (6)
Some recent results on Ramsey-type numbers (2013) (6)
Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma (2002) (6)
A note on Thomassenʼs conjecture (2011) (6)
On Canonical Ramsey Numbers for Coloring Three-Element Sets (1993) (6)
On generalized shift graphs (2014) (6)
Statistics of orderings (2017) (6)
On a problem in combinatorial geometry (1983) (6)
On a product dimension of bipartite graphs (1983) (6)
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (2020) (6)
Colouring steiner quadruple systems (1982) (6)
An optimal algorithm for checking regularity: (extended abstract) (2002) (6)
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (1979) (6)
Note on Ramsey numbers and self-complementary graphs (1995) (5)
Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs (2006) (5)
On generating of relations (1973) (5)
Strong ramsey properties of simplices (2004) (5)
The number of B3-sets of a given cardinality (2016) (5)
Three Remarks on Dimensions of Graphs (1985) (5)
The Erdös-Ko-Rado Theorem for Small Families (1994) (5)
On Large Systems of Sets with No Large Weak Δ-subsystems (1998) (5)
Rigid Linear Binary Codes (1993) (5)
More on the complexity of cover graphs (2010) (5)
Hypergraph Ramsey numbers: tight cycles versus cliques (2015) (5)
Note on the 3-graph counting lemma (2008) (5)
An algorithmic hypergraph regularity lemma (2016) (5)
On Systems of Small Sets with No Large Δ-Subsystems (1999) (5)
Bipartite Coverings of Graphs (1997) (5)
On induced Folkman numbers (2012) (4)
Note on regular subgraphs (1997) (4)
An Algorithmic Embedding of Graphs via Perfect Matchings (1998) (4)
A note on a conjecture by Füredi (2006) (4)
SELECTIVITY OF HYPERGRAPHS (1984) (4)
Embedding hypertrees into steiner triple systems (2018) (4)
Ramsey-type results for oriented trees (1996) (4)
Colorful Flowers (2008) (4)
Iterated combinatorial density theorems (1990) (4)
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness (2008) (4)
On combinatorial properties of spheres in euclidean spaces (1984) (4)
Hereditary quasi-random properties of hypergraphs (2009) (4)
Essentially infinite colourings of hypergraphs (2007) (4)
The complexity of cover graph recognition for some varieties of finite lattices (1995) (4)
Color critical hypergraphs with many edges (2006) (4)
Note on robust critical graphs with large odd girth (2010) (3)
On graphs with a given endomorphism monoid (2009) (3)
Extractors for Small Zero-Fixing Sources (2019) (3)
Ramsey-type numbers involving graphs and hypergraphs with large girth (2015) (3)
On critical 3-chromatic hypergraphs (1977) (3)
Ramsey families which exclude a graph (1995) (3)
Note on a Ramsey Theorem for Posets with Linear Extensions (2016) (3)
Finding Folkman Numbers via MAX CUT Problem (2008) (3)
Block Sizes in Pairwise Balanced Designs (1984) (3)
On large intersecting subfamilies of uniform setfamilies (2003) (3)
On k-chromatically connected graphs (2009) (3)
Monotone paths in ordered graphs (1982) (3)
Ramsey Properties of Random Graphs and Folkman Numbers (2016) (3)
TR-2003-010 Asymptotically tight bounds for some multicolored Ramsey numbers (2002) (3)
On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems (1997) (3)
MORE RESULTS ON SUBGRAPHS WITH MANY SHORT CYCLES (1984) (3)
The chromatic number of finite type-graphs (2016) (3)
On strong Sidon sets of integers (2021) (3)
On homogeneous sets of positive integers (2003) (3)
How to build a barricade (1984) (2)
On the number of graphs with a given endomorphism monoid (2010) (2)
On sets of integers with the Schur property (1986) (2)
On coverings of random graphs (1982) (2)
Monochromatic Trees with Respect to Edge Partitions (1993) (2)
Note on decomposition of spheres in Hilbert spaces (1986) (2)
Cycle-connected graphs (1992) (2)
A short proof of Erdős’ conjecture for triple systems (2016) (2)
On set systems determined by intersections (1981) (2)
On quantitative aspects of a canonisation theorem for edge‐orderings (2020) (2)
Note on asymptotically good packings (2009) (2)
A short proof of the induced Ramsey Theorem for hypergraphs (2016) (2)
Supersaturation For Ramsey-Turán Problems (2006) (2)
On local Turán problems (2021) (2)
Metric spaces with point character equal to their size (2010) (1)
The Minimum Number of Edges in Uniform Hypergraphs with Property O (2016) (1)
Ramsey Properties of Families of Graphs (2002) (1)
A Note on Universal and Canonically Coloured Sequences (2009) (1)
Chromatic Ramsey Theory (1997) (1)
Proper Bounded Edge-Colorings (1998) (1)
Triangulations and the Hajós conjecture (2008) (1)
An optimal algorithm for computing Frieze – Kannan regular partitions (2011) (1)
Packing minor closed families of graphs (2015) (1)
Isomorphic edge disjoint subgraphs of hypergraphs (2016) (1)
Complexity of diagrams (1993) (1)
JUMPS AND NON-JUMPS IN MULTIGRAPHS (2012) (1)
Introduction Ramsey Theory Old and New (1990) (1)
Packing Paths in Steiner Triple Systems (2019) (1)
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm (2021) (1)
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links (2022) (1)
A note on ranking functions (1987) (1)
Every Steiner triple system contains almost spanning d-ary hypertree (2021) (1)
Representing Subdirect Product Monoids by Graphs (2009) (1)
On the Distribution of Monochromatic Configurations (1989) (1)
Folkman Numbers for Graphs of Small Order (1993) (1)
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs (1993) (1)
Increasing paths in countable graphs (2019) (1)
Discrepancy and eigenvalues of Cayley graphs (2016) (0)
On the function of Erdős and (2009) (0)
Equivalent Conditions for Regularity (Extended Abstract) (2000) (0)
Covering of r-Graphs by Complete r-Partite Subgraphs (1995) (0)
Publikációk Listája Hajnal Péter Megjelent [1] Partition of graphs with condition on the connectivity and minimum degree, COMBINATORICA, (2009) (0)
Endomorphisms of Partially Ordered Sets (1998) (0)
Note on the point character of l1-spaces (2013) (0)
A note on the universal and canonically colored sequences (2009) (0)
Some recollections on early work with Jan Pelant (2009) (0)
A short proof of Erdős’ conjecture for triple systems (2017) (0)
A note on weak delta systems (2019) (0)
TR-2011-007 Tree-minimal graphs are almost regular (2011) (0)
TR-2004-018 A Short Proof of the 3-Graph Counting Lemma (2007) (0)
An exponential-type upper bound for Folkman numbers (2016) (0)
Cliques in Steiner systems (2009) (0)
Distribution Agreement on Graphs with a given Endomorphism Monoid Dean of the Graduate School Date on Graphs with a given Endomorphism Monoid on Graphs with a given Endomorphism Monoid on Graphs with a given Endomorphism Monoid (0)
The complexity of proving that a graph is Ramsey (2016) (0)
Independent Sets in Subgraphs of a Shift Graph (2021) (0)
A blurred view of Van der Waerden type theorems (2021) (0)
On classes of graphs determined by forbidden subgraphs (1983) (0)
Statistics of orderings (2017) (0)
Ramsey Partial Orders from Acyclic Graphs (2017) (0)
On hereditarily rigid algebras (1986) (0)
Extremal problems for linear orders on [n]p (1996) (0)
Note on the point character of l1-spaces (2013) (0)
Some recollections on early work with (2008) (0)
Atomy ve svazu uniformit (1980) (0)
TR-2009-030 On a conjecture of Thomassen (2009) (0)
The Generalization of Dirac's Theorem for Hypergraphs (2005) (0)
Sparse Pseudorandom Objects (2010) (0)
TR-2009-029 A theorem on incidence matrices and quasirandom hypergraphs (2009) (0)
Discrepancy and Eigenvalues of Cayley Graphs ( extended abstract ) (2006) (0)
On the Hamiltonicity of Triple Systems with High Minimum Degree (2017) (0)
Covering the Edges of a Random Hypergraph by Cliques (2022) (0)
On induced Ramsey numbers for k‐uniform hypergraphs (2016) (0)
ON SUPERSATURATED SET SYSTEMS 1 (2014) (0)
Jumps and Nonjumps in Multigraphs (2013) (0)
2 THE REGULARITY METHOD 3 2 . 2 The counting lemma (0)

This paper list is powered by the following services:

Other Resources About Vojtěch Rödl

What Schools Are Affiliated With Vojtěch Rödl?

Vojtěch Rödl is affiliated with the following schools:

Vojtěch Rödl's Academic­Influence.com Rankings

Vojtěch Rödl's Degrees

Why Is Vojtěch Rödl Influential?

Vojtěch Rödl's Published Works

Published Works

Other Resources About Vojtěch Rödl

What Schools Are Affiliated With Vojtěch Rödl?

Vojtěch Rödl's AcademicInfluence.com Rankings