Results 91 to 100 of about 605,731 (305)
Hypergraphs with infinitely many extremal constructions
Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
On extremal k-outconnected graphs
The author cites two results of \textit{W. Mader} [Arch. Math. 23, 553--560 (1972; Zbl 0228.05119), Math. Nachr. 53, 145--150 (1972; Zbl 0217.02504), and Abh. Math. Semin. Univ. Hamb. 37, 86--97 (1972; Zbl 0215.33803)] and one of \textit{M. Cai} [Discrete Math. 41, 229--234 (1982; Zbl 0522.05040)] for minimally \(k\)-connected graphs.
openaire +2 more sources
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures [PDF]
We consider extremal problems ‘of Turán type’ for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such ‘(r, q)-graph’ Gn we associate an r-linear form whose maximum over the standard (n − 1 ...
Simonovits, M, Brown, W.G
core +1 more source
Objective Youth who experience a sport‐related knee injury have elevated odds of becoming overweight or developing obesity in 3 to 10 years, compounding their risk for posttraumatic osteoarthritis (PTOA). To inform prevention strategies, this study compared patterns of adiposity change between youth with a sport‐related knee injury and uninjured youth ...
Justin M. Losciale +6 more
wiley +1 more source
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
On Extremal Graphs with Bounded Girth
Abstract By the extremal number ex ( n ; t ) = ex ( n ; { C 3 , C 4 , … , C t } ) we denote the maximum size (number of edges) in a graph of n vertices, n > t , and girth (length of shortest cycle) at least g ⩾ t + 1 .
Charles Delorme +4 more
openaire +2 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source

