The following pages link to Raphael Yuster (Q222643):
Displaying 50 items.
- A Ramsey type result for oriented trees (Q338566) (← links)
- Forcing \(k\)-repetitions in degree sequences (Q405103) (← links)
- Approximate shortest paths in weighted graphs (Q414929) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Hardness and algorithms for rainbow connection (Q491198) (← links)
- The effect of edge weights on clique weights (Q501285) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets (Q532131) (← links)
- On the size of dissociated bases (Q540128) (← links)
- Equitable hypergraph orientations (Q540133) (← links)
- Edge coloring complete uniform hypergraphs with many components (Q598467) (← links)
- On the density of a graph and its blowup (Q602726) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← links)
- Incremental distance products via faulty shortest paths (Q783710) (← links)
- Rainbow \(H\)-factors (Q815207) (← links)
- Decomposing oriented graphs into transitive tournaments (Q817766) (← links)
- Grid graphs, Gorenstein polytopes, and domino stackings (Q844215) (← links)
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Unavoidable tournaments (Q895998) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
- All \(P_{3}\)-equipackable graphs (Q960935) (← links)
- Large induced subgraphs with equated maximum degree (Q965950) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- On rainbow connection (Q1010776) (← links)
- Packing transitive triples in a tournament (Q1021375) (← links)
- Large disjoint subgraphs with the same order and size (Q1024273) (← links)
- (Q1028110) (redirect page) (← links)
- Multigraphs (only) satisfy a weak triangle removal lemma (Q1028803) (← links)
- Decompositions of complete multipartite graphs (Q1043595) (← links)
- A comment on Ryser's conjecture for intersecting hypergraphs (Q1043791) (← links)
- Almost \(H\)-factors in dense graphs (Q1196560) (← links)
- Covering graphs: The covering problem solved (Q1269896) (← links)
- Orthogonal colorings of graphs (Q1277141) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Recognizing global occurrence of local properties (Q1296525) (← links)
- Optimal factorizations of families of trees (Q1301677) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← links)
- On packing trees into complete bipartite graphs (Q1356567) (← links)
- Independent transversals in \(r\)-partite graphs (Q1377695) (← links)
- Packing graphs: The packing problem solved (Q1378488) (← links)
- Efficient covering designs of the complete graph (Q1378499) (← links)
- Covering the edges of a graph by a prescribed tree with minimum overlap (Q1386432) (← links)
- Second neighborhood via first neighborhood in digraphs (Q1400800) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- The order of monochromatic subgraphs with a given minimum degree (Q1408537) (← links)
