EXPECTED NODE-INDEPENDENCE NUMBER OF RANDOM TREES

被引：0

作者：

MEIR, A ^{[1
]}

MOON, JW ^{[1
]}

机构：

[1] UNIV ALBERTA,EDMONTON,ALBERTA,CANADA

来源：

PROCEEDINGS OF THE KONINKLIJKE NEDERLANDSE AKADEMIE VAN WETENSCHAPPEN SERIES A-MATHEMATICAL SCIENCES | 1973年 / 76卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：335 / 341

页数：7

共 50 条

[1] On the independence number of some random trees
Janson, Svante
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2020, 25 : 1 - 14
[2] On the Independence Number of Random Trees via Tricolourations
Bellin, Etienne
Leibniz International Proceedings in Informatics, LIPIcs, 2022, 225
[3] On the independence number of random trees via tricolourations
Bellin, Etienne
arXiv, 2022,
[4] A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Fuchs, Michael
Holmgren, Cecilia
Mitsche, Dieter
Neininger, Ralph
DISCRETE APPLIED MATHEMATICS, 2021, 292 : 64 - 71
[5] The expected independent domination number of random directed rooted trees
Song, JH
Lee, CW
JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2004, 41 (05) : 921 - 931
[6] SUBGRAPH NUMBER INDEPENDENCE IN TREES
GRAHAM, RL
SZEMEREDI, E
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (02) : 213 - 222
[7] ON THE INDEPENDENCE NUMBER OF RANDOM GRAPHS
FRIEZE, AM
DISCRETE MATHEMATICS, 1990, 81 (02) : 171 - 175
[8] Approximating the independence number and the chromatic number in expected polynomial time
Krivelevich, M
Vu, VH
AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 13 - 24
[9] Approximating the independence number and the chromatic number in expected polynomial time
Krivelevich, M
Vu, VH
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (02) : 143 - 155
[10] Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
Michael Krivelevich
Van H. Vu
Journal of Combinatorial Optimization, 2002, 6 : 143 - 155

← 1 2 3 4 5 →