Yuster, Raphael Packing and covering a given directed graph in a directed graph. (English) Zbl 07786277 SIAM J. Discrete Math. 38, No. 1, 43-54 (2024). MSC: 05C70 05C20 05C35 05C38 68R10 PDFBibTeX XMLCite \textit{R. Yuster}, SIAM J. Discrete Math. 38, No. 1, 43--54 (2024; Zbl 07786277) Full Text: DOI arXiv
Yuster, Raphael The number of bounded-degree spanning trees. (English) Zbl 1522.05042 Random Struct. Algorithms 62, No. 3, 737-757 (2023). MSC: 05C05 05C30 05C07 05C40 PDFBibTeX XMLCite \textit{R. Yuster}, Random Struct. Algorithms 62, No. 3, 737--757 (2023; Zbl 1522.05042) Full Text: DOI arXiv
Draganić, Nemanja; Munhá Correia, David; Sudakov, Benny; Yuster, Raphael Ramsey number of 1-subdivisions of transitive tournaments. (English) Zbl 1497.05170 J. Comb. Theory, Ser. B 157, 176-183 (2022). MSC: 05C55 05D10 05C20 PDFBibTeX XMLCite \textit{N. Draganić} et al., J. Comb. Theory, Ser. B 157, 176--183 (2022; Zbl 1497.05170) Full Text: DOI arXiv
Yuster, Raphael Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs. (English) Zbl 07464277 J. Comb. Theory, Ser. B 153, 195-222 (2022). MSC: 05C45 05C80 05C65 PDFBibTeX XMLCite \textit{R. Yuster}, J. Comb. Theory, Ser. B 153, 195--222 (2022; Zbl 07464277) Full Text: DOI arXiv
Nassar, Safwat; Yuster, Raphael All feedback arc sets of a random Turán tournament have \(\lfloor{n}/{k}\rfloor-{k}+1\) disjoint \({k}\)-cliques (and this is tight). (English) Zbl 1467.05095 SIAM J. Discrete Math. 35, No. 2, 1460-1477 (2021). MSC: 05C20 05C35 05C80 PDFBibTeX XMLCite \textit{S. Nassar} and \textit{R. Yuster}, SIAM J. Discrete Math. 35, No. 2, 1460--1477 (2021; Zbl 1467.05095) Full Text: DOI arXiv
Caro, Yair; Yuster, Raphael Induced subgraphs with many repeated degrees. (English) Zbl 1435.05143 Discrete Math. 343, No. 5, Article ID 111828, 7 p. (2020). MSC: 05C60 05C07 PDFBibTeX XMLCite \textit{Y. Caro} and \textit{R. Yuster}, Discrete Math. 343, No. 5, Article ID 111828, 7 p. (2020; Zbl 1435.05143) Full Text: DOI arXiv
Fox, Jacob; Gishboliner, Lior; Shapira, Asaf; Yuster, Raphael The removal lemma for tournaments. (English) Zbl 1414.05131 J. Comb. Theory, Ser. B 136, 110-134 (2019). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Fox} et al., J. Comb. Theory, Ser. B 136, 110--134 (2019; Zbl 1414.05131) Full Text: DOI arXiv
Yuster, Raphael On the maximum number of spanning copies of an orientation in a tournament. (English) Zbl 1371.05111 Comb. Probab. Comput. 26, No. 5, 775-796 (2017). MSC: 05C20 05C35 05C45 PDFBibTeX XMLCite \textit{R. Yuster}, Comb. Probab. Comput. 26, No. 5, 775--796 (2017; Zbl 1371.05111) Full Text: DOI arXiv
Yuster, Raphael Dense graphs with a large triangle cover have a large triangle packing. (English) Zbl 1252.05103 Comb. Probab. Comput. 21, No. 6, 952-962 (2012). MSC: 05C42 05C70 PDFBibTeX XMLCite \textit{R. Yuster}, Comb. Probab. Comput. 21, No. 6, 952--962 (2012; Zbl 1252.05103) Full Text: DOI arXiv
Caro, Yair; Yuster, Raphael Colorful monochromatic connectivity. (English) Zbl 1223.05065 Discrete Math. 311, No. 16, 1786-1792 (2011). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{Y. Caro} and \textit{R. Yuster}, Discrete Math. 311, No. 16, 1786--1792 (2011; Zbl 1223.05065) Full Text: DOI
Yuster, Raphael Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. (English) Zbl 1224.05476 Combinatorica 30, No. 2, 239-246 (2010). Reviewer: Ove Frank (Stockholm) MSC: 05C80 PDFBibTeX XMLCite \textit{R. Yuster}, Combinatorica 30, No. 2, 239--246 (2010; Zbl 1224.05476) Full Text: DOI arXiv
Shapira, Asaf; Yuster, Raphael The effect of induced subgraphs on quasi-randomness. (English) Zbl 1209.05230 Random Struct. Algorithms 36, No. 1, 90-109 (2010). MSC: 05C80 PDFBibTeX XMLCite \textit{A. Shapira} and \textit{R. Yuster}, Random Struct. Algorithms 36, No. 1, 90--109 (2010; Zbl 1209.05230) Full Text: DOI arXiv
Shapira, Asaf; Yuster, Raphael On the density of a graph and its blowup. (English) Zbl 1208.05067 J. Comb. Theory, Ser. B 100, No. 6, 704-719 (2010). MSC: 05C42 PDFBibTeX XMLCite \textit{A. Shapira} and \textit{R. Yuster}, J. Comb. Theory, Ser. B 100, No. 6, 704--719 (2010; Zbl 1208.05067) Full Text: DOI arXiv
Yuster, Raphael Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets. (English) Zbl 1159.05320 Goel, Ashish (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008, Boston, MA, USA, August 25–27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85362-6/pbk). Lecture Notes in Computer Science 5171, 596-601 (2008). MSC: 05C80 PDFBibTeX XMLCite \textit{R. Yuster}, Lect. Notes Comput. Sci. 5171, 596--601 (2008; Zbl 1159.05320) Full Text: DOI Link
Yuster, Raphael Combinatorial and computational aspects of graph packing and graph decomposition. (English) Zbl 1302.05149 Comput. Sci. Rev. 1, No. 1, 12-26 (2007). MSC: 05C70 05C85 68Q25 05C07 05C65 05C80 05C20 05-02 PDFBibTeX XMLCite \textit{R. Yuster}, Comput. Sci. Rev. 1, No. 1, 12--26 (2007; Zbl 1302.05149) Full Text: DOI
Nutov, Zeev; Yuster, Raphael Packing directed cycles efficiently. (English) Zbl 1129.05035 Discrete Appl. Math. 155, No. 2, 82-91 (2007). MSC: 05C70 05C38 05C20 05C85 68R10 90C05 PDFBibTeX XMLCite \textit{Z. Nutov} and \textit{R. Yuster}, Discrete Appl. Math. 155, No. 2, 82--91 (2007; Zbl 1129.05035) Full Text: DOI