44 research outputs found
Spanning trees in sparse expanders
Given integers , let be the
collection of all -vertex trees with maximum degree at most . A
question of Alon, Krivelevich and Sudakov in 2007 asks for determining the best
possible spectral gap condition forcing an -graph to be
-universal, namely, it contains all members of
as a subgraph simultaneously. In this paper we show
that for all and sufficiently large , every -graph with is
-universal. As an immediate corollary, this implies
that Alon's ingenious construction of triangle-free sparse expander is
-universal, which provides an explicit construction of
such graphs and thus solves a question of Johannsen, Krivelevich and Samotij.
Our main result is formulated under a much more general context, namely, the
-expanders. More precisely, we show that there exist absolute constants
such that the following statement holds for sufficiently large integer
.
For all , every -expander is -universal.
For all with , every -expander is -universal.
Both results significantly improve a result of Johannsen, Krivelevich and
Samotij, and have further implications in locally sparse expanders and
Maker-Breaker games that also improve previously known results drastically.Comment: 27 pages, 4 figures, comments are welcom
On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory
We prove that for with and , there exist
and such that for every , every -vertex
graph with and
contains an -th power of a Hamilton cycle. We also
show that the minimum degree condition is asymptotically sharp for and
the case was recently conjectured by Staden and Treglown.Comment: 19 pages, 4 figure
Rainbow Hamilton cycle in hypergraph systems
R\"{o}dl, Ruci\'{n}ski and Szemer\'{e}di proved that every -vertex
-graph , and is sufficiently large, with
contains a tight Hamilton cycle, which can
be seen as a generalization of Dirac's theorem in hypergraphs. In this paper,
we extend this result to the rainbow setting as follows. A -graph system
is a family of not necessarily distinct
-graphs on the same -vertex set , a -graph on is rainbow if
and for
. Then we show that given , sufficiently large
and an -vertex -graph system , if
for , then there exists a rainbow
tight Hamilton cycle.Comment: 20 pages,5 figure
On the Population Monotonicity of Independent Set Games
An independent set game is a cooperative game defined on graphs and dealing
with profit sharing in maximum independent set problems. A population monotonic
allocation scheme is a rule specifying how to share the profit of each
coalition among its participants such that every participant is better off when
the coalition expands. In this paper, we provide a necessary and sufficient
characterization for population monotonic allocation schemes in independent set
games. Moreover, our characterization can be verified efficiently
Production of human blood group B antigen epitope conjugated protein in Escherichia coli and utilization of the adsorption blood group B antibody
Additional file 1: Table S1. List of constructed plasmids, strains and primers used in the study. Figure S1. MALDI-TOF detection of MBPmut (a) and MBPmut-OPS (b)
A genome-wide association study of severe asthma exacerbations in Latino children and adolescents
Severe asthma exacerbations are a major cause of school absences and healthcare costs in children, particularly those in high-risk racial/ethnic groups. To identify susceptibility genes for severe asthma exacerbations in Latino children and adolescents, we conducted a meta-analysis of genome-wide association studies (GWAS) in 4010 Latino youth with asthma in four independent cohorts, including 1693 Puerto Ricans, 1019 Costa Ricans, 640 Mexicans, 256 Brazilians, and 402 members of other Latino subgroups. We then conducted methylation quantitative trait locus (mQTL), expression quantitative trait locus (eQTL), and expression quantitative trait methylation (eQTM) analyses to assess whether the top SNP in the meta-analysis is linked to DNA methylation and gene expression in nasal (airway) epithelium in separate cohorts of Puerto Rican and Dutch children and adolescents. In the meta-analysis of GWAS, a SNP in FLJ22447 (rs2253681) was significantly associated with 1.55 increased odds of severe asthma exacerbations (95% confidence interval=1.34 to 1.79, p=6.3×10-9). This SNP was significantly associated with DNA methylation of a CpG site (cg25024579) at the FLJ22447 locus, which was in turn associated with increased expression of KCNJ2-AS1 in nasal airway epithelium from Puerto Rican children and adolescents (β=0.10, p=2.18×10-7). Thus, SNP rs2253681 was significantly associated with both DNA methylation of a cis-CpG in FLJ22447 and severe asthma exacerbations in Latino youth. This may be partly explained by changes in airway epithelial expression of a gene recently implicated in atopic asthma in Puerto Rican children and adolescents (KCNJ2-AS1)
On-line scheduling of small open shops
We investigate theprobl4 ofon-l.E schedulw4 open shops of two and three machines with an objective of minimizing theschedul makespan. We #rst propose a 1.848-competitive permutationalmutati for the non-preemptiveschedulmp problu of two machines and show that no permutationalrmutat can be better than 1.754-competitive.Secondlo wedevel. a (27=19)-competitiveal)-comp for the preemptive schedulve problu of three machines, which is most competitive. ? 2001El1C8.7 Science B.V.Al rights reserved
-factors in graphs with small independence number
Let be an -vertex graph. The vertex arboricity of is the
least integer such that can be partitioned into parts and each
part induces a forest in . We show that for sufficiently large , every -vertex graph with and contains an
-factor, where or . The result can be viewed an
analogue of the Alon--Yuster theorem \cite{MR1376050} in Ramsey--Tur\'{a}n
theory, which generalises the results of
Balogh--Molla--Sharifzadeh~\cite{MR3570984} and Knierm--Su~\cite{MR4193066} on
clique factors. In particular the degree conditions are asymptotically sharp
for infinitely many graphs which are not cliques.Comment: 25 pages, 1 figur
Experimental Research on Variable Parameter Forming Process for Forming Specimen of TC4 Titanium Alloy by Selective Laser Melting
To optimize the microstructure and properties of TC4 specimens formed by selective laser melting (SLM), the test program of formed specimens by the variable parameter forming process (VPFP) was designed based on the quantitative parameter forming process (QPFP). The purpose of this study is to explore the influence of the VPFP on the surface morphology, tensile properties, and microstructure of the specimens. The test results show that the surface morphology and tensile properties of the specimens were better formed by the VPFP. The internal holes of the specimens formed by the VPFP were small in volume and occupied a relatively small proportion, and the density could reach 99.7%. When the laser power was 300 W–260 W and equally divided into six hierarchies, the tensile strength could reach 1185.214 MPa by VPFP, but the elongation had no obvious change. The number of secondary acicular martensite α’ phases was decreased in the microstructure of the specimens formed with VPFP. With the superposition of the hierarchy, the length of the primary acicular martensite α’ phase became shorter, the width became larger, and the width of the columnar crystal β phase became smaller. The VPFP is used to change the inherent method of forming specimens with the same parameters, which provides a new idea for SLM-forming structures; the test provides data and yields a theoretical research basis for forming the specimens process method