Inducibility of directed paths
Inducibility of directed paths
复制标题
有向路径的可归纳性
DOI:
10.1016/j.disc.2020.112015
复制
发表时间:
2020
影响因子:
0.8
通讯作者:
Pfender, Florian
中科院分区:
文献类型:
--
作者:
Choi, Ilkyoo;Lidický, Bernard;Pfender, Florian
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more tractable. Here we resolve this problem in the setting of oriented graphs without transitive triangles.
登录
查看更多内容
DOI:
10.1137/18m1169473
发表时间:
2017-04
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
Bernard Lidick'y;Florian Pfender
通讯作者:
Bernard Lidick'y;Florian Pfender
DOI:
10.1016/0095-8956(75)90084-2
发表时间:
1975
期刊:
Journal of Combinatorial Theory, Series B
影响因子:
--
作者:
N. Pippenger;M. Golumbic
通讯作者:
M. Golumbic
DOI:
10.1016/j.jctb.2017.04.002
发表时间:
2014
期刊:
J. Comb. Theory B
影响因子:
--
作者:
J. Balogh;Ping Hu;Bernard Lidický;Florian Pfender;Jan Volec;Michael Young
通讯作者:
Michael Young
影响因子:
0.9
作者:
Ellen Gethner;L. Hogben;Bernard Lidický;Florian Pfender;Amanda Ruiz;Michael Young
通讯作者:
Michael Young
DOI:
10.1137/130926614
发表时间:
2013
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
R. Baber;John M. Talbot
通讯作者:
John M. Talbot