本文介绍两个关于有向图的"Min-Max"型问题。(笔记整理来自USTC Extremal Graph Theory课堂讲义) 1.Gallai-Roy Theorem 首先是一个关于有向图染色数与路长度的著名定理,它叙述的是有向图的染色数与有向图中最长路的一个不等关系。我们下面用 χ(G) 来记一个图的色数,对有向图 D ,定义其色数就是对应无向...
In this paper I have presented some central min- max theorems in graph theory from the view point of linear programming. I study and review the Maximum flow Minimum cut theorem and discussed the standard proof using Ford-Fulkerson algorithm. Also I focused on some graph theoretic consequences ...
Read about Euler's theorems in graph theory such as the path theorem, the cycle theorem, and the sum of degrees theorem. See examples of the...
The characterization of zero-sum (mod 2) bipartite Ramsey numbers - Caro, Yuster - 1998 () Citation Context ...bgraph G in Kn,n (see theorems 3.2... Y Caro,R Yuster - 《Journal of Graph Theory》 被引量: 6发表: 2015年 Infinite Time Nonzero-Sum Linear Quadratic Stochastic Differential...
57Citations 3Altmetric Explore all metrics Abstract In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve ...
Summary: Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined in terms of logic and graph theory. An archetypal algorithmic meta theorem is Courcelle's Theorem [1], which states...
One of the more recent generalizations of the Erdős–Ko–Rado theorem, formulated by Holroyd, Spencer and Talbot, defines the Erdős–Ko–Rado property for graphs in the following manner: for a graph G, vertex v∈G and some integer r⩾1 denote the family of independent r-sets of V...
Normal hypergraphs and the perfect graph conjecture, Discrete Math 2(1972) 253–267. Article MathSciNet MATH Google Scholar Lovasz, L., A characterization of perfect graph, to appear in J. Comb. Theory. Google Scholar Sachs, H., On the Berge conjecture concerning perfect graphs, Comb. ...
Woeginger, Backbone colorings for graphs: Tree and path backbones, Journal of Graph Theory, v.55 n.2, p.137-152, June 2007 [doi>10.1002/jgt.v55:2]C. Balbuena , T. Jiang , Y. Lin , X. Marcote , M. Miller, A lower bound on the order of regular graphs with given girth pair...
This work is an investigation of the uniform thickness property (UTP) for knots in the contact 3-sphere. We establish cabling theorems for the UTP: in part... DJ Lafountain 被引量: 0发表: 2010年 On the uniform thickness property and contact geometric knot theory. This work is an investig...