Results 311 to 320 of about 8,223,452 (320)

Independent sets in graphs

Discrete Mathematics and Applications, 2016
Abstract We give a survey of the enumeration of independent sets in graphs and of some related problems.
Dainyak, Aleksandr B., Sapozhenko, Aleksandr A.   +1 more
openaire   +2 more sources

Independent Set Readings and Generalized Quantifiers

Journal of Philosophical Logic, 2009
The aim of this paper is to provide a uniform, modular, and improved logical framework for a class of multiple nested generalized quantifiers (GQs), namely the independent set (IS) readings that hold for noun phrases (NPs) associated with distributive predications (IS-dis).
openaire   +3 more sources

Independence results concerning Dedekindfinite sets

Journal of the Australian Mathematical Society, 1975
A Dedekind-finite set is one not equinumerous with any of its proper subsets; it is well known that the axiom of choice implies that all such sets are finite. In this paper we show that in the absence of the axiom of choice it is possible to construct Dedekind-finite sets which are large, in the sense that they can be mapped onto large ordinals; we ...
openaire   +2 more sources

Independent sets ink-chromatic graphs

Combinatorica, 1985
A k-colouring of a graph G is a map \(\Psi\) : V(T)\(\to \{1,2,...,k\}\) such that no two adjacent vertices have the same image. A k-critical graph is a connected k-chromatic graph in which each of its edges is critical, i.e., the chromatic number of G-e is k-1 for any edge e of G. A graph G is said to have property \(P_ k\) if in each k-colouring of G
openaire   +2 more sources

Contexts/Settings: Private/Independent Practice Settings

2013
Private independent practice (known historically as private practice) is a growing segment of the social work profession. Social workers entering this context are providing a range of services, including clinical and nonclinical. Major considerations for establishing, maintaining, and marketing a successful and ethical private independent practice will
openaire   +1 more source

Join-Independent and Meet-Independent Sets in Complete Lattices

Order, 2001
Let \(L\) be a complete lattice. A subset \(A\) of \(L\) is called join-independent if \(a\not \leq\sup A\setminus \{a\}\) for all \(a\in A\) (a meet-independent set is defined dually). For a set \(X\subseteq L\), let \(\psi (X)\) denote the supremum of \(X\) in \(L\).
openaire   +2 more sources

Independent Validation Sets

NIR news, 2013
openaire   +1 more source

Dominating sets, covering sets and independent sets

1962
openaire   +1 more source

Finitely positively independent sets

Mathematical Notes of the Academy of Sciences of the USSR, 1979
Gusak, I. Ya., Shashkin, Yu. A.
openaire   +2 more sources

INDEPENDENCE RESULTS IN SET THEORY

2014
openaire   +2 more sources