Existence of large independent-like sets
نویسندگان
چکیده
منابع مشابه
Finding Large Independent Sets
This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...
متن کاملProbabilistic Existence of Large Sets of Designs
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been introduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain conditions, a randomly chosen structure has the required properties of a t(n, k, λ) combinatorial design with tiny, yet positive, probability. Herein, we strengthen both ...
متن کاملThe Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs
We investigate the existence and efficient algorithmic construction of close to optimal independent sets in random models of intersection graphs. In particular, (a) we propose a new model for random intersection graphs (Gn,m,~ p) which includes the model of [10] (the “uniform” random intersection graphs model) as an important special case. We also define an interesting variation of the model of...
متن کاملDegrees of M-fuzzy families of independent L-fuzzy sets
The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...
متن کاملLarge k-independent sets of regular graphs
We present a simple, yet efficient, heuristic for finding a large 2-independent set of regular graphs. We analyse the average-case performance of this heuristic, which is a randomised greedy algorithm, by analysing its performance on random regular graphs using differential equations. In this way, we prove lower bounds on the expected size of a largest 2-independent set of random regular graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2020
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm7649-11-2018