Results 211 to 220 of about 50,923 (254)
Impact of Father Involvement and Positive Parenting on Child Mental Health: Insights From a Survey of Ugandan Households. [PDF]
Fam ProcessAsiimwe R +6 more
europepmc +1 more source
Beyond fossil plastics: next-generation PLA-based bio-packaging for industrial applications - advances, challenges, and data-driven insights. [PDF]
RSC AdvHasoon K T N, Panicker UG.
europepmc +1 more source
Fabrication and Characterization of Solution Blow Spun Zinc Oxide Nanoparticles/Polyvinyl Butyral Nanofiber Membranes for Food Packaging. [PDF]
Polymers (Basel)Zhang M +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 ...
János Komlós +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 ...
János Komlós +2 more
openaire +1 more source
Scientific American, 2006
auch ersch. in "Swiat Nauki, Vol.11, 36-43" (poln. Scientific American) als "Jak rozsadzic gwiazde?" und in "Nikkei Science, Vol.1, 32-40" (jap. Scientific American)
Hillebrandt, W., Janka, H., Müller, E.
openaire +3 more sources
auch ersch. in "Swiat Nauki, Vol.11, 36-43" (poln. Scientific American) als "Jak rozsadzic gwiazde?" und in "Nikkei Science, Vol.1, 32-40" (jap. Scientific American)
Hillebrandt, W., Janka, H., Müller, E.
openaire +3 more sources
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
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
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