Results 11 to 20 of about 983,866 (300)
Hypergraph Independent Sets [PDF]
Combinatorics, Probability and Computing, 2012 The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge.
Cutler, Jonathan, Radcliffe, A. J.
openaire +5 more sources
Eternal Independent Sets in Graphs [PDF]
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +3 more sources
Open-independent, open-locating-dominating sets [PDF]
Electronic Journal of Graph Theory and Applications, 2017 A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G).
Suk J. Seo, Peter J. Slater
doaj +3 more sources
Families of k-independent sets [PDF]
Discrete Mathematics, 1973 AbstractA collection F of sets is k-independent if for any selections A, B of k1 and k2 of its members with k1+k2=k, there are elements in all the members of A and not in the members of B. Bounds on the maximal size of k-independent families exponential in the total number of elements are obtained.
Daniel J. Kleitman, Joel H. Spencer
openaire +2 more sources
Matroid Valuation on Independent Sets [PDF]
Journal of Combinatorial Theory, Series B, 1997 Recently \textit{A. W. M. Dress} and \textit{W. Wenzel} [Adv. Math. 93, No. 2, 214-250 (1992; Zbl 0754.05027)] introduced the concept of valuated matroid in terms of a quantitative extension of the basis exchange axiom for matroids. This paper gives two sets of cryptomorphically equivalent axioms of valuated matroids in terms of a function defined on ...
Murota, Kazuo
openaire +3 more sources
Rate-independent evolution of sets [PDF]
, 2021 The goal of this work is to analyze a model for the rate-independent evolution of sets with finite perimeter. The evolution of the admissible sets is driven by that of (the complement of) a given time-dependent set, which has to include the admissible ...
Rossi, Riccarda +2 more
core +1 more source
New Results Relating Independence and Matchings
Discussiones Mathematicae Graph Theory, 2022 In this paper we study relationships between the matching number, written µ(G), and the independence number, written α(G).
Caro Yair, Davila Randy, Pepper Ryan
doaj +1 more source
A note on r-equitable k-colorings of trees [PDF]
Yugoslav Journal of Operations Research, 2014 A graph G = (V;E) is r-equitably k-colorable if there exists a partition of V into k independent sets V1, V2,... Vk such that ||Vi|- |Vj|| ≤ r for all i,j {1,2... k}.
Hertz Alain, Ries Bernard
doaj +1 more source
1-Extendability of Independent Sets
Algorithmica, 2022 Abstract In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational complexity of 1-extendability, the problem of deciding whether a graph is 1-extendable.
Pierre Bergé +3 more
openaire +3 more sources
On independent sets in hypergraphs [PDF]
Random Structures & Algorithms, 2012 AbstractThe independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove that if Hn is an n‐vertex ‐uniform hypergraph in which every r‐element set is contained in at most d edges, where , then urn:x-wiley::media:rsa20453:rsa20453-math-0004 where satisfies as .
Alexandr V. Kostochka +2 more
openaire +3 more sources