19 results on '"Rödl, Vojtêch"'
Search Results
2. The chromatic number of finite type-graphs
3. Embedding tetrahedra into quasirandom hypergraphs
4. Packing minor-closed families of graphs into complete graphs
5. On generalized Ramsey numbers of Erdős and Rogers
6. Some constructive bounds on Ramsey numbers
7. Weak hypergraph regularity and linear hypergraphs
8. An almost quadratic bound on vertex Folkman numbers
9. A note on the jumping constant conjecture of Erdős
10. Small subsets inherit sparse ε-regularity
11. Short paths in quasi-random triple systems with sparse underlying graphs
12. A note on Thomassenʼs conjecture
13. On the chromatic number and independence number of hypergraph products
14. On the minimum order of graphs with given semigroup
15. The Ramsey property for graphs with forbidden complete subgraphs
16. Chromatically optimal rigid graphs
17. On color critical graphs
18. A ramsey type problem concerning vertex colourings
19. A short proof of the existence of highly chromatic hypergraphs without short cycles
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.