Results 61 to 70 of about 934 (196)
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Dense H-free graphs are almost (Χ(H)-1)-partite [PDF]
, 2010 By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true.
Peter Allen, Allen, Peter
core
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
On the number of $\mathcal {H}$ -free hypergraphs
Forum of Mathematics, SigmaTwo central problems in extremal combinatorics are concerned with estimating the number $\mathrm {ex}(n,\mathcal {H})$ , the size of the largest $\mathcal {H}$ -free hypergraph on n vertices, and the number $\mathrm {forb}(n,\mathcal {H})$
Tao Jiang, Sean Longbrake
doaj +1 more source
Hypergraph removal lemmas via robust sharp threshold theorems
Discrete Analysis, 2020 Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
Various Problems in Extremal Combinatorics [PDF]
, 2012 Extremal combinatorics is a central theme of discrete mathematics. It deals with the problems of finding the maximum or minimum possible cardinality of a collection of finite objects satisfying certain restrictions.
Huang, Hao
core
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley +1 more source
EFSA Journal, Volume 24, Issue 6, June 2026.Abstract A report commenting on three quantitative pest risk assessments (qPRA) of the EFSA PLH Panel (Panel) was published in November 2025 by the Office for Risk Assessment & Research (BuRO) of the Netherlands Food and Product Safety Authority. In that report, the approaches applied by the Panel in three qPRA were narratively scrutinised against an ...
EFSA Panel on Plant Health (PLH) +26 more
wiley +1 more source