In this short note I discuss two problems which we discussed during the hypergraph meeting. I. The following conjecture is attributed to I. Zarins by Bondy and Chvatal: Let k be an integer and n> n (k) 0. Then i
2. Two long-standing problems in graph theory Two long-standing problems in graph theory are the skew partition problem and the clique graph problem. The skew partition problem was defined by Chvátal in 1985 as the recognition problem for a special decomposition arising in the context of perfect...
This book provides a rapid introduction to topics in graph theory typically covered in a graduate course. The author sets out the main recent results in several areas of current research in graph theory. Topics covered include edge-colourings, symmetries of graphs, packing of graphs, and computat...
In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of Simple Max Cut (Max Cut with edge weights restricted to value 1), and, as a corollary, the completeness of the Optimal ...
10.1.1.234.2288 On some extremal problems in graph theory (2008) by Dmitry Jakobson , Igor Rivin [图论中的某些极值问题] 热度: Zwiebach B. - A First Course in String Theory. Solutions to problems, part 1(T)(143s) (1970) 热度: 视译 口译 Sight translation as a topic in ...
Quan- tum query complexity for some graph problems. In SOFSEM 2004: Theory and Practice of Computer Science, volume 2932, pages 1-11, 2004.A. Berzina, A. Dubrovsky, R. Freivalds, L. Lace, and O. Scegulnaja. Quantum query complexity for some graph problems. In SOFSEM, pages 140-150,...
We then show, for example, that matrix multiplication is independent of any of the following problems: computing the transitive closure of a graph, the rank of a matrix, a set of independent rows and columns in a matrix, a maximum bipartite matching, etc.doi:10.1080/00207168508803454...
Chapter 24 Some Examples from Graph Theory As the title suggests, this chapter will introduce some examples where the Catalan numbers arise in graph theory. In Chapter 12, we were … - Selection from Fibonacci and Catalan Numbers: An Introduction [Book]
Some Interesting Combinatorial Problems 主要介绍组合数学方向中的有趣问题Yifan 数学话题下的优秀答主 · 18 篇内容 · 4185 赞同 · 2354 订阅 订阅专栏推荐文章专栏介绍 已更内容 主要介绍组合数学方向中的有趣问题 专栏作者 Yifan 数学家 关注 知乎影响力 获得7 万次赞同 · 1.3 万次喜欢 · 3.5 ...
Andreas Brandstadt, Van Bang Le, and Thomas Szymczak. The complexity of some prob- lems related to graph 3-colorability. Discrete Applied Mathematics, 89(1-3):59-73, 1998.Brandstädt, A, Le, VB, Szymczak, T (1998) The complexity of some problems related to graph 3-colorability. ...