Results 221 to 230 of about 167,507 (265)
Some of the next articles are maybe not open access.
Combinatorica, 1997
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Blowing Up Symplectic Orbifolds
Annals of Global Analysis and Geometry, 2001The author studies different blow-up constructions on symplectic orbifolds by using different circle actions. Some of these constructions are used to describe the behavior of reduced spaces of Hamiltonian circle actions on a symplectic orbifold, when passing a critical level of its Hamiltonian function. Using these descriptions, the author generalizes,
openaire +2 more sources
2017
This is a powerful resource for anyone who wants to understand the nature of interpersonal conflict—to study it, understand why it's a consistent part of human history, and perhaps avert it in their own lives. Why does conflict surround us in everyday life, from spats between individuals to major conflicts involving large groups?
openaire +1 more source
This is a powerful resource for anyone who wants to understand the nature of interpersonal conflict—to study it, understand why it's a consistent part of human history, and perhaps avert it in their own lives. Why does conflict surround us in everyday life, from spats between individuals to major conflicts involving large groups?
openaire +1 more source
Combinatorics, Probability and Computing, 1999
Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding ...
openaire +2 more sources
Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding ...
openaire +2 more sources
Mathematical Proceedings of the Cambridge Philosophical Society, 1960
The behaviour of the Chern classes or of the canonical classes of an algebraic variety under a dilatation has been studied by several authors (Todd (8)–(11), Segre (5), van de Ven (12)). This problem is of interest since a dilatation is the simplest form of birational transformation which does not preserve the underlying topological structure of the ...
openaire +2 more sources
The behaviour of the Chern classes or of the canonical classes of an algebraic variety under a dilatation has been studied by several authors (Todd (8)–(11), Segre (5), van de Ven (12)). This problem is of interest since a dilatation is the simplest form of birational transformation which does not preserve the underlying topological structure of the ...
openaire +2 more sources