204 results on '"Taraz, Anusch"'
Search Results
2. The tree packing conjecture for trees of almost linear maximum degree
3. Perfectly packing graphs with bounded degeneracy and many leaves
4. A spanning bandwidth theorem in random graphs
5. Perfectly packing graphs with bounded degeneracy and many leaves
6. On the size-Ramsey number of grid graphs
7. Minimal Ramsey graphs for cyclicity
8. Approximating the Minimum $k$-Section Width in Bounded-Degree Trees with Linear Diameter
9. On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
10. The Bandwidth Theorem in Sparse Graphs
11. Counting results for sparse pseudorandom hypergraphs I
12. Ramsey numbers for bipartite graphs with small bandwidth
13. An approximate version of the Tree Packing Conjecture
14. Logical limit laws for minor-closed classes of graphs
15. Supporting document to the paper 'Logical limit laws for minor-closed classes of graphs'
16. Spanning embeddings of arrangeable graphs with sublinear bandwidth
17. An Extension of the Blow-up Lemma to arrangeable graphs
18. Coloring d-Embeddable k-Uniform Hypergraphs
19. Perfect graphs of fixed density: counting and homogenous sets
20. Almost spanning subgraphs of random graphs after adversarial edge removal
21. Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs
22. Embedding into bipartite graphs
23. Logical limit laws for minor-closed classes of graphs
24. Counting results for sparse pseudorandom hypergraphs I
25. Zählen
26. Ramsey-Theorie
27. Algebraische Methoden
28. Probabilistische Methoden
29. Grundlagen
30. Graphen und Ordnungen
31. On extremal properties of minimal Ramsey graphs and cross intersecting families
32. Perfectly packing graphs with bounded degeneracy and many leaves
33. Coloring d-Embeddable k-Uniform Hypergraphs
34. On the structure of graphs with large minimum bisection
35. Ramsey numbers for bipartite graphs with small bandwidth
36. An approximate version of the tree packing conjecture
37. Colouring Random Graphs in Expected Polynomial Time
38. Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
39. Coloring k -Uniform Hypergraphs
40. A spanning bandwidth theorem in random graphs
41. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
42. New combinatorial proofs for enumeration problems and random anchored structures
43. Spanning 3-colourable subgraphs of small bandwidth in dense graphs
44. Proof of the bandwidth conjecture of Bollobás and Komlós
45. A spanning bandwidth theorem in random graphs.
46. Artificial intelligence and operations research in maritime logistics
47. The bandwidth theorem in sparse graphs
48. For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
49. Diskrete Mathematik
50. Efficiently covering complex networks with cliques of similar vertices
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.