×

Found 5 Documents (Results 1–5)

Minimum clique-free subgraphs of Kneser graphs. (English. Russian original) Zbl 1477.05126

Dokl. Math. 102, No. 3, 472-473 (2020); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 495, 31-33 (2020).
MSC:  05C60 05C69
PDFBibTeX XMLCite
Full Text: DOI

Improvement of the lower bound in the Erdös-Hajnal combinatorial problem. (English. Russian original) Zbl 1281.05099

Dokl. Math. 79, No. 3, 349-350 (2009); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 426, No. 2, 177-178 (2009).
MSC:  05C65 05C15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Year of Publication

Main Field