Results 11 to 20 of about 69 (69)
Multiple separation theorems [PDF]
Proceedings of the American Mathematical Society, 1994 We prove multiple separation theorems for duals of Spector pointclasses.
openaire +2 more sources
A separation theorem in property testing [PDF]
Combinatorica, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Asaf Shapira
openaire +2 more sources
A Genralization of Sturm's Separation Theorem [PDF]
Proceedings of the American Mathematical Society, 1970 A Sturmian separation theorem is established for elliptic-parabolic equations with minimal assumptions on the coefficients and none on the regularity of the domain. A comparison theorem for linear equations and a separation theorem for quasi-linear equations are then obtained as applications.
openaire +1 more source
A separation theorem for nonlinear systems
Automatica, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kilicaslan, Sinan, Banks, Stephen P.
openaire +2 more sources
A Separator Theorem for Chordal Graphs [PDF]
SIAM Journal on Algebraic Discrete Methods, 1984 A graph is called chordal if every cycle of it of length at least four has a chord. In the paper it is proved: Let G be a chordal graph with n vertices and m edges. Then G has a set of O(\(\sqrt{m})\) vertices whose removal leaves no connected component with more than n/2 vertices.
Gilbert, John R. +2 more
openaire +2 more sources
A separation theorem in dimension 3 [PDF]
Nagoya Mathematical Journal, 1996 Let M be a compact non-singular real affine algebraic variety and let A, B be open disjoint semialgebraic subsets of M. Define (where —4 denotes the Zariski closure).
Acquistapace, F. +2 more
openaire +3 more sources
Separability generalizes Dirac's theorem
Discrete Applied Mathematics, 1998 A set of vertices in a graph is a maximal clique module if it is a module (a homogeneous set) and a clique, and is inclusion-maximal with respect to both properties. A maximal clique module of a graph \(G\) is called a moplex if its neighborhood is a minimal separator of \(G\). A moplex is simplicial if its neighborhood is a clique. The authors prove: (
Anne Berry, Jean Paul Bordat
openaire +1 more source
Linear Algebra and its Applications, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Separating the Fan Theorem and Its Weakenings [PDF]
The Journal of Symbolic Logic, 2013 AbstractVarieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational hierarchy. Some of the implications have been shown to be strict, others strict in a weak context, and yet others not at all, using disparate techniques.
Robert S. Lubarsky, Hannes Diener
openaire +2 more sources
Separation theorems for oriented matroids
Discrete Mathematics, 1988 In this paper we show that Minty's lemma can be used to prove the Hahn- Banach theorem as well as other theorems in this class such as Radon's and Helly's theorem for oriented matroids having an intersection property which guarantees that every pair of flats intersects in some point extension \({\mathcal O}\cup p\) of the oriented matroid \({\mathcal O}
Achim Bachem, Alfred Wanka
openaire +2 more sources