461 research outputs found

    Minimum degrees for powers of paths and cycles

    Full text link
    We study minimum degree conditions under which a graph GG contains kthk^{th} power of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of G is large. This extends a result of Allen, B\"ottcher and Hladk\'y concerning the containment of squares of paths and squares of cycles of arbitrary specified lengths and settles a conjecture of theirs in the affirmative.Comment: 69 pages, 3 figures. arXiv admin note: text overlap with arXiv:0906.3299 by other author

    Job Demands, Job Resources and Work Stress: A Study Among Customs Officers In Malaysia

    Get PDF
    The main purpose of this research is to examine the relationships of job demands, job resources and work stress among customs officers in Malaysia. The survey questionnaire was designed to elicit responses from the participants. A total of 800 questionnaires were distributed to the employees of the Royal Malaysian Customs Department. There are 215 usable questionnaires were returned, yielding a response rate of 26.9%. The collected data were analyzed using the Statistical Package for Social Science (SPSS) version 25. The results indicated that job demands were positively related to work stress. On the other hand, job resources were found negatively related to work stress. The findings showed that Customs Officers were suffered from work stress due to job demands yet the job resources reduced their work stress. Thus, the Royal Malaysian Customs Department must put a great emphasis on the significant roles played by job demands and job resources to reduce employee’s stress levels in the organization

    Coupled discrete/continuum simulations of the impact of granular slugs with clamped beams: stand-off effects

    Get PDF
    Coupled discrete particle/continuum simulations of the normal (zero obliquity) impact of granular slugs against the centre of deformable, end-clamped beams are reported. The simulations analyse the experiments of Uth et al. (2015) enabling a detailed interpretation of their observations of temporal evolution of granular slug and a strong stand-off distance dependence of the structural response. The high velocity granular slugs were generated by the pushing action of a piston and develop a spatial velocity gradient due to elastic energy stored during the loading phase by the piston. The velocity gradient within the “stretching” slug is a strong function of the inter-particle contact stiffness and the time the piston takes to ramp up to its final velocity. Other inter-particle contact properties such as damping and friction are shown to have negligible effect on the evolution of the granular slug. The velocity gradients result in a slug density that decreases with increasing stand-off distance, and therefore the pressure imposed by the slug on the beams is reduced with increasing stand-off. This results in the stand-off dependence of the beam's deflection observed by Uth et al. (2015). The coupled simulations capture both the permanent deflections of the beams and their dynamic deformation modes with a high degree of fidelity. These simulations shed new light on the stand-off effect observed during the loading of structures by shallow-buried explosions

    Embedding problems in graphs and hypergraphs

    Get PDF
    In this thesis, we explore several mathematical questions about substructures in graphs and hypergraphs, focusing on algorithmic methods and notions of regularity for graphs and hypergraphs. We investigate conditions for a graph to contain powers of paths and cycles of arbitrary specified linear lengths. Using the well-established graph regularity method, we determine precise minimum degree thresholds for sufficiently large graphs and show that the extremal behaviour is governed by a family of explicitly given extremal graphs. This extends an analogous result of Allen, Böttcher and Hladký for squares of paths and cycles of arbitrary specified linear lengths and confirms a conjecture of theirs. Given positive integers k and j with j < k, we study the length of the longest j-tight path in the binomial random k-uniform hypergraph Hk(n, p). We show that this length undergoes a phase transition from logarithmic to linear and determine the critical threshold for this phase transition. We also prove upper and lower bounds on the length in the subcritical and supercritical ranges. In particular, for the supercritical case we introduce the Pathfinder algorithm, a depth-first search algorithm which discovers j-tight paths in a k-uniform hypergraph. We prove that, in the supercritical case, with high probability this algorithm finds a long j-tight path. Finally, we investigate the embedding of bounded degree hypergraphs into large sparse hypergraphs. The blow-up lemma is a powerful tool for embedding bounded degree spanning subgraphs with wide-ranging applications in extremal graph theory. We prove a sparse hypergraph analogue of the blow-up lemma, showing that large sparse partite complexes with sufficiently regular small subcomplex counts and no atypical vertices behave as if they were complete for the purpose of embedding complexes with bounded degree and bounded partite structure
    • …
    corecore