Maximum number of colors in hypertrees of bounded degree
نویسندگان
چکیده
منابع مشابه
Maximum number of colors in hypertrees of bounded degree
The upper chromatic number χ(H) of a hypergraph H = (X, E) is the maximum number of colors that can occur in a vertex coloring φ : X → N such that no edge E ∈ E is completely multicolored. A hypertree (also called arboreal hypergraph) is a hypergraph whose edges induce subtrees on a fixed tree graph. It has been shown that on hypertrees it is algorithmically hard not only to determine exactly b...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in most cases an induced copy of K1,3, the claw, which motivates studying the question on claw-free graphs. Note that on g...
متن کاملThe Ramsey number of a graph with bounded maximum degree
The Ramsey number of a graph G is the least number t for which it is true that whenever the edges of the complete graph on t vertices are colored in an arbitrary fashion using two colors, say red and blue, then it is always the case that either the red subgraph contains G or the blue subgraph contains G. A conjecture of P. Erdos and S. Burr is settled in the afftrmative by proving that for each...
متن کاملMaximum Likelihood Markov Hypertrees
One popular class of such models are Markov networks, which use an undirected graph to represent dependencies among variables. Markov networks of low tree-width (i.e. having a triangulation with small cliques ) allow efficient computations, and are useful as learned probability models [8]. A well studied case is that in which the dependency structure is known in advance. In this case the underl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2014
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-014-0357-4