【摘 要】
：
Kelmans and Seymour independently conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5.Ma and Yu proved that this co
【机 构】
：
GeorgiaInstituteofTechnology,Atlanta,GA30332,USA
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Kelmans and Seymour independently conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5.Ma and Yu proved that this conjecture holds for graphs containing K4-.I will discuss recent progress we made on this conjecture.This is joint work with Dawei He and Yan Wang.
其他文献
Outline ·Introduction;·Constructions of Orthogonal Arrays;·Augmented Orthogonal Arrays;·All or nothing transform
分析了不完整信息下赛博作战的复杂网络。赛博空间:第四次世界大战爆发的触点?第一枪 赛博战最令人恐惧的地方就是具有针对性:敌人可以跨越国界攻击一个人、一类人、甚至一个
The original EKR(Erd(o)s-Ko-Rado)theorem describes the size and structure of the largest collection of intersecting k-subsets of the set [n]={1,2,…,n}.
In many fields of human activity we have to find an unknown object with as little cost as possible.A mathematical model of such problems and first general r
For two given graphs G and H,the Ramsey number R(G,H)is the smallest integer N such that any red-blue edge colorings of a complete graph Kn,either there is
Let G be an edge-bicolored graph where each edge is colored either blue or red.We discuss problems of obtaining a subgraph H from G that simultaneously sati
A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal clique with at least two vertices is monochromatic.
In this talk,we first review progress of some research topics on symmetries of graphs,such as arc-transitive graphs,half-arc-transitive graphs,edge-primitiv
In this paper we give a proof of Enomotos conjecture for graphs of sufficiently large order.
There are various positivity problems in combinatorics,such as the unimodality,log-concavity and log-convexity of combinatorial sequences,and the realrooted