51 results on '"Taraz, Anusch"'
Search Results
2. A spanning bandwidth theorem in random graphs
3. On the structure of graphs with large minimum bisection
4. Ramsey numbers for bipartite graphs with small bandwidth
5. Coloring d-Embeddable k-Uniform Hypergraphs
6. Zählen
7. Probabilistische Methoden
8. Grundlagen
9. Graphen und Ordnungen
10. Ramsey-Theorie
11. Algebraische Methoden
12. Diskrete Mathematik
13. The Bandwidth Theorem in sparse graphs
14. Colouring Random Graphs in Expected Polynomial Time
15. Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
16. Logical limit laws for minor-closed classes of graphs
17. On minimum bisection and related cut problems in trees and tree-like graphs
18. Counting results for sparse pseudorandom hypergraphs II
19. Counting results for sparse pseudorandom hypergraphs I
20. An approximate version of the tree packing conjecture
21. Approximating Minimum k -Section in Trees with Linear Diameter
22. Local resilience of spanning subgraphs in sparse random graphs
23. On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width
24. Spanning embeddings of arrangeable graphs with sublinear bandwidth
25. An Extension of the Blow-up Lemma to Arrangeable Graphs
26. Coloring $$d$$ d -Embeddable $$k$$ k -Uniform Hypergraphs
27. Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal
28. Perfect Graphs of Fixed Density: Counting and Homogeneous Sets
29. Induced C5-free graphs of fixed density: counting and homogeneous sets
30. Primality of trees
31. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
32. Embedding into Bipartite Graphs
33. Almost spanning subgraphs of random graphs after adversarial edge removal
34. Coloring Random Intersection Graphs and Complex Networks
35. Proof of the bandwidth conjecture of Bollobás and Komlós
36. Bandwidth, treewidth, separators, expansion, and universality
37. Spanning 3-colourable subgraphs of small bandwidth in dense graphs
38. The random planar graph process
39. Embedding spanning subgraphs of small bandwidth
40. Efficiently covering complex networks with cliques of similar vertices
41. Degree Sequences of $F$-Free Graphs
42. Large planar subgraphs in dense graphs
43. Globally bounded local edge colourings of hypergraphs
44. Exact and approximative algorithms for coloring G(n,p)
45. On random planar graphs, the number of planar graphs and their triangulations
46. For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
47. Almost all graphs with high girth and suitable density have high chromatic number
48. Phase Transitions in the Evolution of Partial Orders
49. Counting Partial Orders with a Fixed Number of Comparable Pairs
50. Asymptotic enumeration, global structure, and constrained evolution
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.