On some extremal problems in graph theory - Jakobson, RivinJakobson, D., Rivin, I.: On some extremal problems in graph theory. ar- Xiv:math.CO/9907050.(1999)D. Jakobson and I Rivin, On some extremal problems in graph theory, Preprint....
We say that a graph G is a clique graph if G belongs to the image of the clique operator, i.e., if there exists a graph H such that G=K(H). Note that the number of maximal complete sets may be exponential on the number of vertices. Consider, for instance, the graph consisting ...
problems in graph theory and probability This dissertation is a study of some properties of graphs, based on four journal papers (published, submitted, or in preparation). In the first part, a random graph model associated to scale-free networks is studied. In particular, prefe... J Choi ...
On some extremal problems in graph theory In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their an... D Jakobson,I Rivin - 《Electronic Journal of Combinatorics》 被引量: 184发表: 1999年 ...
- 《IEEE Transactions on Parallel & Distributed Systems》 被引量: 1发表: 2017年 A method for solving extremal problems in graph theory, stability problems CiteSeerX - Scientific documents that cite the following paper: A method for solving extremal problems in graph theory, stability problems, in...
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...
We aim here at obtaining an explicit expression of the solution of the Dirichlet and Poisson problems on graphs. To this end, we consider the Laplacian of a graph as a kernel on the vertex set, V, in the framework of Potential Theory. Then, the properties of such a kernel allow us to...
Graphs on surfaces是Topological and structural graph theory中的重要问题,其中的一些问题(比如crossing number)在incidenc…阅读全文 赞同63 21 条评论 分享收藏 一些我很喜欢的组合证明 1. Sylvester-Gallai Theorem: 上任意 个不全共线的点,至少存在一条直线恰好经过其中的两个点。(CO.In...
on Words—a wide area with many deep results, sophisticated methods, important applications and intriguing open problems.The main purpose of this survey is to present a range of new directions relating Thue sequences more closely to Graph Theory, Combinatorial Geometry, and Number Theory. For...
Binary Trees Sum of Nodes on the Longest path from root to leaf node <-> Binary Trees Check if given graph is tree or not. [ IMP ] <-> Binary Trees Find Largest subtree sum in a tree <-> Binary Trees Maximum Sum of nodes in Binary tree such that no two are adjacent <-> ...