科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
P
Paul Seymour
princeton university
70
H指数
461
论文数
2.5W
被引数
0
相关解读
订阅
收录论文
9
发表时间
发表时间
IF
被引数
The vertex sets of subtrees of a tree
树的子树的顶点集
ELECTRONIC JOURNAL OF COMBINATORICS
IF
0.7
2026-04-14
0
PRE
AI
Chudnovsky, Maria; Nguyen, Tung; Scott, Alex; Seymour, Paul
分享
收藏
Induced subgraph density. VI. Bounded VC-dimension
诱导子图密度。VI. 有界VC维
Advances in Mathematics
IF
1.5
2025-10-01
0
OA
AI
Nguyen, Tung; Scott, Alex; Seymour, Paul
分享
收藏
Trees and near-linear stable sets
树和近线性稳定集
COMBINATORICA
IF
0
2025-09-25
0
OA
AI
Nguyen, Tung; Scott, Alex; Seymour, Paul
分享
收藏
Thomassen's theorem on the two-linkage problem in acyclic digraphs: A shorter proof
Thomassen关于无环有向图中双连接问题的定理:一个更短的证明
JOURNAL OF COMBINATORIAL THEORY SERIES B
IF
0
2025-09-01
0
PRE
AI
Seymour, Paul
分享
收藏
Dense minors of graphs with independence number two
独立数为2的图的稠密子图
JOURNAL OF COMBINATORIAL THEORY SERIES B
IF
0
2025-09-01
0
PRE
AI
Norin, Sergey; Seymour, Paul
分享
收藏
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
IEEE-ACM TRANSACTIONS ON NETWORKING
IF
3.6
2012-02-01
25
OA
AI
Birand, Berk; Chudnovsky, Maria; Ries, Bernard; Seymour, Paul; Zussman, Gil; Zwols, Yori
分享
收藏
The strong perfect graph theorem
ANNALS OF MATHEMATICS
IF
5.3
2006-07-01
777
OA
AI
Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin
分享
收藏
Node placement and sizing for copper broadband access networks
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2001-01-01
9
PRE
AI
Carpenter, T; Eiger, M; Shallcross, D; Seymour, P
分享
收藏
The ring loading problem
SIAM REVIEW
IF
6.1
1999-01-01
14
PRE
AI
Schrijver, A; Seymour, P; Winkler, P
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
N
Neil Robertson
H 指数: 75 · 论文数: 673
A
Alexander Schrijver
H 指数: 52 · 论文数: 298
A
Alex Scott
H 指数: 46 · 论文数: 341
G
Gil Zussman
H 指数: 44 · 论文数: 297
P
Peter Winkler
H 指数: 41 · 论文数: 418
查看更多