Towards size reconstruction from fewer cards
Discrete Mathematics（2015）
摘要
It is proved that if two graphs of order n have n - p cards (vertex-deleted subgraphs) in common, where p ¿ 3 , and n is large enough compared with p , then the numbers of edges in the two graphs differ by at most p - 2 . This is a modest but nontrivial improvement of the easy result that these numbers differ by at most p .
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要