Pages that link to "Item:Q1199484"
From MaRDI portal
The following pages link to Matching and covering the vertices of a random graph by copies of a given graph (Q1199484):
Displaying 15 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Increasing the flexibility of the herding attack (Q763502) (← links)
- \(H(n)\)-factors in random graphs (Q945455) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Corrádi and Hajnal's Theorem for Sparse Random Graphs (Q2883851) (← links)
- Perfect Matchings in Random <i>r</i>-regular, <i>s</i>-uniform Hypergraphs (Q4883058) (← links)
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
- Nonvertex‐Balanced Factors in Random Graphs (Q4982288) (← links)
- Tilings in Randomly Perturbed Dense Graphs (Q5219315) (← links)
- Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors (Q6052470) (← links)
- Counting extensions revisited (Q6074702) (← links)
- Cycle Saturation in Random Graphs (Q6170438) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
