Pages that link to "Item:Q1792104"
From MaRDI portal
The following pages link to Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104):
Displaying 12 items.
- Triangle factors in sparse pseudo-random graphs (Q558243) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Clique-factors in sparse pseudorandom graphs (Q2323252) (← links)
- Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q5886099) (← links)
- Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
- Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)