98 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. SPECIFIED INTERSECTIONS
14. Maximal independent sets in the covering graph of the cube
15. Some recent results on Ramsey-type numbers
16. Efficient Testing of Hypergraphs : Extended Abstract
17. Near-optimum Universal Graphs for Graphs with Bounded Degrees : Extended Abstract
18. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
19. Maximal independent sets in bipartite graphs obtained from Boolean lattices
20. Some constructive bounds on Ramsey numbers
21. Weak hypergraph regularity and linear hypergraphs
22. An almost quadratic bound on vertex Folkman numbers
23. On the number of graphs with a given endomorphism monoid
24. Some recollections on early work with Jan Pelant
25. Perfect matchings in large uniform hypergraphs with large minimum collective degree
26. On [formula omitted]-chromatically connected graphs
27. Threshold Functions for Ramsey Properties
28. Strong Ramsey Theorems for Steiner Systems
29. Two Proofs in Combinatorial Number Theory
30. On a Probabilistic Graph-Theoretical Method
31. Note on the 3-graph counting lemma
32. Turán's theorem for pseudo-random graphs
33. A note on the jumping constant conjecture of Erdős
34. Small subsets inherit sparse ε-regularity
35. Perfect matchings in uniform hypergraphs with large minimum degree
36. Short paths in quasi-random triple systems with sparse underlying graphs
37. All Triangles are Ramsey
38. Ramsey-type numbers involving graphs and hypergraphs with large girth.
39. Independent Deuber sets in graphs on the natural numbers
40. Hypergraphs, Quasi-randomness, and Conditions for Regularity
41. On the Turán Number of Triple Systems
42. Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers
43. The asymptotic number of triple systems not containing a fixed one
44. Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
45. Ramsey-type numbers involving graphs and hypergraphs with large girth
46. Packing minor closed families of graphs
47. A note on Thomassenʼs conjecture
48. Note on a Ramsey-Turán type problem
49. Hereditary quasi-random properties of hypergraphs
50. Finding Folkman Numbers via MAX CUT Problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.