Results 81 to 90 of about 34,901 (303)
On triangles in ‐minor free graphs [PDF]
Journal of Graph Theory, 2017 AbstractWe study graphs where each edge that is incident to a vertex of small degree (of degree at most 7 and 9, respectively) belongs to many triangles (at least 4 and 5, respectively) and show that these graphs contain a complete graph (K6 and K7, respectively) as a minor. The second case settles a problem of Nevo.
Boris Albar, Daniel Gonçalves 0001
openaire +1 more source
Tailoring Phonon‐Driven Responses in α‐MoO3 through Isotopic Enrichment
Advanced Materials, EarlyView.ABSTRACT The implementation of polaritonic materials into nanoscale devices requires selective tuning of parameters to realize desired spectral or thermal responses. One robust material, α‐MoO3, an orthorhombic crystal boasting three distinct phonon dispersions, provides three polaritonic dispersions of hyperbolic phonon polaritons (HPhPs) across the ...
Thiago S. Arnaud +31 more
wiley +1 more source
An analytic approach to sparse hypergraphs: hypergraph removal
Discrete Analysis, 2018 An analytic approach to sparse hypergraphs: hypergraph removal, Discrete Analysis 2018:3, 47 pp. The famous triangle removal lemma of Ruzsa and Szemerédi states that for every $\epsilon>0$ there exists $\delta>0$ such that every graph $G$ on $n ...
Henry Towsner
doaj +1 more source
An improved bound on the largest induced forests for triangle-free planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We proved that every planar triangle-free graph of order n has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour (2006).
Lukasz Kowalik +2 more
doaj +1 more source
10 Problems for Partitions of Triangle-free Graphs
, 2022 We will state 10 problems, and solve some of them, for partitions in triangle-free graphs related to Erdős' Sparse Half Conjecture. Among others we prove the following variant of it: For every sufficiently large even integer n the following holds.
Clemen, Felix Christian +2 more
core
Advanced Materials Interfaces, EarlyView.Large size (∼100 µm) monolayer MoS2 grown by LPI‐CVD on n‐GaN exhibit a high n‐type doping, very low strain, and a type‐I band alignment at MoS2/GaN interface. Photocurrent measurements under illumination with photon energies from ∼2 to ∼5 eV show superior electro‐optical performances of these MoS2/n‐GaN heterojunctions as compared to Ni/n‐GaN devices ...
Salvatore Ethan Panasci +12 more
wiley +1 more source
On equality in an upper bound for the acyclic domination number [PDF]
Opuscula Mathematica, 2008 A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source
Divisibility Patterns within Pascal Divisibility Networks
Mathematics, 2020 The Pascal triangle is so simple and rich that it has always attracted the interest of professional and amateur mathematicians. Their coefficients satisfy a myriad of properties.
Pedro A. Solares-Hernández +3 more
doaj +1 more source
Complete Graph Drawings up to Triangle Mutations
, 2022 International audienceThe main result of the paper can be stated in the following way: a complete graph drawing in the sphere, where two edges have at most one common point, which is either a crossing or a common endpoint, and no three edges share a ...
Gioan, Emeric
core +1 more source