49 results on '"Joos, Felix"'
Search Results
2. A Short Proof of the Blow-Up Lemma for Approximate Decompositions
3. Decomposing hypergraphs into cycle factors
4. On the (6,4)-problem of Brown, Erd\H{o}s, and Sos.
5. The Edge-Erdős-Pósa Property
6. Conflict‐free hypergraph matchings.
7. Euler Tours in Hypergraphs
8. On kissing numbers and spherical codes in high dimensions
9. Random perfect matchings in regular graphs.
10. CRITICAL PERCOLATION ON RANDOM REGULAR GRAPHS
11. Long Cycles have the Edge-Erdős-Pósa Property
12. A Unified Erdős–Pósa Theorem for Constrained Cycles
13. Badly-covered graphs
14. How to determine if a random graph with a fixed degree sequence has a giant component
15. Induced Cycles in Graphs
16. A Note on Longest Paths in Circular Arc Graphs
17. Structural Parameterizations for Boxicity
18. Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree.
19. Fractional cycle decompositions in hypergraphs.
20. PERCOLATION ON RANDOM GRAPHS WITH A FIXED DEGREE SEQUENCE.
21. Resolution of the Oberwolfach problem.
22. Counting Hamilton cycles in Dirac hypergraphs.
23. ERDŐS-PÓSA PROPERTY FOR LABELED MINORS: 2-CONNECTED MINORS.
24. Pseudorandom hypergraph matchings.
25. A rainbow blow‐up lemma.
26. On a rainbow version of Dirac's theorem.
27. Spanning trees in randomly perturbed graphs.
28. Optimal packings of bounded degree trees.
29. EDGE CORRELATIONS IN RANDOM REGULAR HYPERGRAPHS AND APPLICATIONS TO SUBGRAPH TESTING.
30. On Graphs with Induced Matching Number Almost Equal to Matching Number
31. A stronger bound for the strong chromatic index
32. Maximum induced matchings close to maximum matchings
33. A characterization of substar graphs
34. Domination and total domination in cubic graphs of large girth
35. FRAMES, A-PATHS, AND THE ERDŐS--PÓSA PROPERTY.
36. Long cycles through prescribed vertices have the Erdős-Pósa property.
37. How to determine if a random graph with a fixed degree sequence has a giant component.
38. A Stronger Bound for the Strong Chromatic Index.
39. Parity Linkage and the Erdős-Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs.
40. INDUCED MATCHINGS IN GRAPHS OF BOUNDED MAXIMUM DEGREE.
41. The Cycle Spectrum of Claw-free Hamiltonian Graphs.
42. INDUCED MATCHINGS IN GRAPHS OF DEGREE AT MOST 4.
43. Equality of distance packing numbers.
44. RANDOM SUBGRAPHS IN SPARSE GRAPHS.
45. A Characterization of Mixed Unit Interval Graphs.
46. Forests and trees among Gallai graphs.
47. Independence and matching number in graphs with maximum degree 4.
48. INDUCED MATCHINGS IN SUBCUBIC GRAPHS.
49. Ramsey Results for Cycle Spectra.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.