Let F ={H1, . . . ,Hk} be a family of graphs. A graph G is called totally F -decomposable iffor every linear combination of the form α1e(H1) + · · · + αke(Hk) = e(G) where each αi is anonnegative integer, there is a coloring of the edges of G with α1 + · · · + αk colors such thatexactly αi color classes induce each a copy of Hi, for i = 1, . . . , k. We prove that if F i...

Any smooth spatial disturbance of a degenerate Fermi gas inevitably becomes sharp. This phenomenon, called the gradient catastrophe, causes the breakdown of a Fermi sea to multiconnected components characterized by multiple Fermi points. We argue that the gradient catastrophe can be probed through a Fermi-edge singularity measurement. In the regime of the gradient catastrophe the Fermi-edge sin...

On-going research of advanced sharp refractory composite leading edges for use on hypersonic air-breathing vehicles is presented in this paper. Intense magnitudes of heating and of heating gradients on the leading edge lead to thermal stresses that challenge the survivability of current material systems. A fundamental understanding of the problem is needed to further design development. Methodo...

We previously determined the minimum size of a maximum matching in a connected (2r + 1)-regular graph with n vertices; the extremal graphs have cut-edges. In this paper, we prove a lower bound for the minimum size of a maximum matching in a t-edge-connected r-regular graph with n vertices, for t ≥ 2 and r ≥ 4. The bound is sharp infinitely often and improves a recent result of Henning and Yeo. ...

A periodically driven quantum Hall system in a fixed magnetic field is found to exhibit a series of phases featuring anomalous edge modes with the "wrong" chirality. This leads to pairs of counter-propagating chiral edge modes at each edge, in sharp contrast to stationary quantum Hall systems. We show that the pair of Floquet edge modes are protected by the chiral (sublattice) symmetry, and tha...

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...

Eroh and Oellerman defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2. We restate the problem of determining BRR(K1,λ,Kr,s) in matrix form and prove estimates and exact values for several choices of the parameters. Our general bound uses Füredi’s result on fractional matchings of uniform ...

Wind loads on structures under the buffeting action of wind gusts have traditionally been treated by the ‘‘gust loading factor’’ (GLF) method in most major codes and standards around the world. In this scheme, the equivalent static wind loading used for design is equal to the mean wind force multiplied by the GLF. Although the traditional GLF method ensures an accurate estimation of the displac...

background and aims. bruxism is defined as a habitual nonfunctional forceful contact between occlusal tooth surfaces. in younger children bruxism may be a consequence of the masticatory neuromuscular system immaturity. the aim of this study was to assess the prevalence of bruxism and investigate the relationship between occlusal factors and bruxism among preschool children. materials and method...

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...