23 results on '"Glock, Stefan"'
Search Results
2. The n-queens completion problem
3. On the (6,4)-problem of Brown, Erd\H{o}s, and Sos.
4. Decompositions into isomorphic rainbow spanning trees
5. Conflict‐free hypergraph matchings.
6. Euler Tours in Hypergraphs
7. On the decomposition threshold of a given graph
8. On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems
9. Optimal path and cycle decompositions of dense quasirandom graphs
10. New results for MaxCut in H$H$‐free graphs.
11. The Existence of Designs via Iterative Absorption: Hypergraph F-designs for Arbitrary F.
12. The largest hole in sparse random graphs.
13. Short proofs for long induced paths.
14. The intersection spectrum of 3‐chromatic intersecting hypergraphs.
15. Resolution of the Oberwolfach problem.
16. Counting Hamilton cycles in Dirac hypergraphs.
17. Pseudorandom hypergraph matchings.
18. Minimalist designs.
19. A rainbow blow‐up lemma.
20. Optimal path and cycle decompositions of dense quasirandom graphs
21. Triple systems with no three triples spanning at most five points.
22. On the f -matching polytope and the fractional f -chromatic index.
23. A Memoryless Semi-Physical Power Amplifier Behavioral Model Based on the Correlation Between AM–AM and AM–PM Distortions.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.