The following pages link to Raphael Yuster (Q222643):
Displaying 50 items.
- A coding theory bound and zero-sum square matrices (Q1423490) (← links)
- Tiling transitive tournaments and their blow-ups (Q1425167) (← links)
- Packing and decomposition of graphs with trees (Q1569062) (← links)
- A Turán type problem concerning the powers of the degrees of a graph (Q1583618) (← links)
- Linear coloring of graphs (Q1584255) (← links)
- Decomposing hypergraphs into simple hypertrees (Q1586356) (← links)
- Arithmetic progressions with constant weight (Q1586772) (← links)
- Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative (Q1587903) (← links)
- Acyclic subgraphs with high chromatic number (Q1621059) (← links)
- Packing without some pieces (Q1630682) (← links)
- The effect of local majority on global majorityin connected graphs (Q1756113) (← links)
- Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs (Q1773883) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- Monotone paths in edge-ordered sparse graphs (Q1841931) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Zero-sum square matrices (Q1864564) (← links)
- The number of edge-disjoint transitive triples in a tournament (Q1886364) (← links)
- The 123 theorem and its extensions (Q1903015) (← links)
- \(H\)-factors in dense graphs (Q1924126) (← links)
- \(H\)-packing of \(k\)-chromatic graphs (Q1937363) (← links)
- A shortest cycle for each vertex of a graph (Q1944201) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Edge-disjoint induced subgraphs with given minimum degree (Q1953440) (← links)
- Intersecting designs (Q1971015) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Dominant tournament families (Q2041696) (← links)
- Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs (Q2072184) (← links)
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs (Q2112584) (← links)
- Ramsey number of 1-subdivisions of transitive tournaments (Q2171017) (← links)
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs (Q2205125) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- Colorful monochromatic connectivity (Q2275401) (← links)
- Perfect sequence covering arrays (Q2302158) (← links)
- Induced subgraphs with many repeated degrees (Q2305934) (← links)
- Ramsey numbers for degree monotone paths (Q2374167) (← links)
- On the longest path of a randomly weighted tournament (Q2399297) (← links)
- On the exact maximum induced density of almost all graphs and their inducibility (Q2421550) (← links)
- The removal lemma for tournaments (Q2421551) (← links)
- Almost exact matchings (Q2429356) (← links)
- Approximating the maximum consecutive subsums of a sequence (Q2437755) (← links)
- Almost given length cycles in digraphs (Q2482351) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- The number of oriantations having no fixed tournament (Q2495691) (← links)
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683) (← links)
- On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
- Dominating a family of graphs with small connected subgraphs (Q2703021) (← links)
- Graphs with large variance. (Q2715981) (← links)
- Graphs having the local decomposition property (Q2760991) (← links)
