High girth and extendability
نویسندگان
چکیده
منابع مشابه
Online coloring graphs with high girth and high odd girth
We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kierstead’s algorithm for graphs that contain neither a C3 or C5 as an induced subgraph. keywords: online algorithms, combinatorial problems
متن کاملWell-covered graphs and extendability
A graph is k-extendable if every independent set of size k is contained in a maximum independent set. This generalizes the concept of a B-graph (i.e. I-extendable graph) introduced by Berge and the concept of a well-covered graph (i.e. k-extendable for every integer k) introduced by Plummer. For various graph families we present some characterizations of well-covered and k-extendable graphs. We...
متن کاملDyck path triangulations and extendability
We introduce the Dyck path triangulation of the cartesian product of two simplices ∆n−1×∆n−1. The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of ∆rn−1 × ∆n−1 using rational Dyck paths. Our study of the Dyck path triangulation is motivated by extendability problems of partial triangulations of products of t...
متن کاملInferning with High Girth Graphical Models
Unsupervised learning of graphical models is an important task in many domains. Although maximum likelihood learning is computationally hard, there do exist consistent learning algorithms (e.g., psuedo-likelihood and its variants). However, inference in the learned models is still hard, and thus they are not directly usable. In other words, given a probabilistic query they are not guaranteed to...
متن کاملExtremal bipartite graphs with high girth
Let us denote by EX (m,n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and have maximum size. In this paper the following question is proposed: does always such an extremal graph G contain a (2t + 2)-cycle? The answer is shown to be affirmative for t = 2, 3 or whenever m and n are large enough ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00039-y