Problems in graph theory from Memphis, in: The Mathematics of - Faudree, Rousseau, et al. - 1997 () Citation Context ...njecture in 1980. Conjecture 1 The pair (G, H) is Ramsey-infinite unless both G and H are stars with an odd number of edges or at least one of G and H ...
graph theory 以图为研究对象的数学分支。图论中的图指的是一些点以及连接这些点的线的总体。通常用点代表事物,用连接两点的线代表事物间的关系、图论则是研究事物对象在上述表示法中具有的特征与性质的学科 。图论的发展已有200多年的历史,它发源于18世纪普鲁士的柯尼斯堡。当地的居民想知道能否从任意一陆地出发 ,...
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...
It deals with problems that are often motivated by questions arising in other a... P Erds 被引量: 0发表: 2017年 Extremal problems in graph theory The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs....
Groetsch CW, Neubauer A (1989) Regularization of ill-posed problems: optimal parameter choice in finite dimensions. J Approx Theory 58(2):184–200 MATHMathSciNetGoogle Scholar Groetsch CW, Schock E (1984) Asymptotic convergence rate of Arcangeli’s method for ill-posed problems. Appl Anal 18...
In this article, we show how, using graph theory, we can make a content analysis of political discourse. Assumptions of this analysis are: • we have a corpus of speech of each party or candidate; • we consider that speech conveys economic, political, socio-cultural values,...
It treats a melange of topics from combinatorial probability theory, number theory, random graph theory and combinatorics. The problems in this book involve the asymptotic analysis of a discrete construct, as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics...
CiteSeerX - Scientific documents that cite the following paper: A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs (Proc M Simonovits 被引量: 611发表: 1968年 Agreement Problems in Networks with Directed Graphs and Switching Topology In this paper, ...
In the case of hypergraphs we consider the substructure consisting of a hypergraph whose order is linear in the order of the large hypergraph. I will show how these problems are extensions of more basic and well-known results in graph theory. I will give full proofs of three new embedding ...
Coloring the vertices of graph such that every two adjacent vertices have different colors is a very common problem in graph theory. This is called a prope... A. M. KHALAF - International journal of electronics, communication & instrumentation engineering research and development: IJECIERD 被引量...