86 results on '"Rödl, Vojtěch"'
Search Results
2. Increasing paths in countable graphs
3. On Hamiltonian cycles in hypergraphs with dense link graphs
4. Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
5. On local Turán problems
6. A Ramsey class for Steiner systems
7. The chromatic number of finite type-graphs
8. Embedding tetrahedra into quasirandom hypergraphs
9. The number of B3-sets of a given cardinality
10. Packing minor-closed families of graphs into complete graphs
11. A note on supersaturated set systems
12. On generalized Ramsey numbers of Erdős and Rogers
13. Maximal independent sets in the covering graph of the cube
14. Some recent results on Ramsey-type numbers
15. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
16. Maximal independent sets in bipartite graphs obtained from Boolean lattices
17. Some constructive bounds on Ramsey numbers
18. Weak hypergraph regularity and linear hypergraphs
19. An almost quadratic bound on vertex Folkman numbers
20. On the number of graphs with a given endomorphism monoid
21. Some recollections on early work with Jan Pelant
22. Perfect matchings in large uniform hypergraphs with large minimum collective degree
23. On [formula omitted]-chromatically connected graphs
24. Note on the 3-graph counting lemma
25. Turán's theorem for pseudo-random graphs
26. A note on the jumping constant conjecture of Erdős
27. Small subsets inherit sparse ε-regularity
28. Perfect matchings in uniform hypergraphs with large minimum degree
29. Short paths in quasi-random triple systems with sparse underlying graphs
30. Independent Deuber sets in graphs on the natural numbers
31. Hypergraphs, Quasi-randomness, and Conditions for Regularity
32. On the Turán Number of Triple Systems
33. Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
34. The asymptotic number of triple systems not containing a fixed one
35. Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
36. Ramsey-type numbers involving graphs and hypergraphs with large girth
37. Packing minor closed families of graphs
38. A note on Thomassenʼs conjecture
39. Hereditary quasi-random properties of hypergraphs
40. Finding Folkman Numbers via MAX CUT Problem
41. On the chromatic number and independence number of hypergraph products
42. Every Monotone 3-Graph Property is Testable
43. On homogeneous sets of positive integers
44. Non-Ramsey Graphs Are c log n-Universal
45. Small Spaces with Large Point Character
46. On a Packing and Covering Problem
47. Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs
48. Chromatic Ramsey Theory
49. Complexity of representation of graphs by set systems
50. Colouring steiner quadruple systems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.