论文部分内容阅读
We prove that every graph of minimum degree at least k+1 contains at least(k-1)/2 cycles with consecutive even lengths.
Minimum Degree and Cycles of Specific Lengths
【摘 要】
：
We prove that every graph of minimum degree at least k+1 contains at least(k-1)/2 cycles with consecutive even lengths.
【机 构】
：
Princeton Univ.
【出 处】
：
第八届工业与应用数学国际大会
【发表日期】
：
2015年期
其他文献
Structure of Helicity and Global Solutions of Incompressible Navier-Stokes Equation Jointly with Zhe
In this paper we derive a new energy identity for the general threedimensional incompressible Navier-Stokes equations by the virtue of a special structure o
会议
The minisymposium presents the state of art of rigorous analysis and numerical simulations of interfacial motions.We have in mind problems,where diffusion o
会议
Liquid crystals represent a vast and diverse class of anisotropic soft matter materials which are intermediate between isotropic liquids and crystalline sol
会议
The transport and distribution of charged particles are crucial in the study of many physical and biological problems.
会议
Starting with the definition of mean curvature flow in the setting of Geometric Measure Theory due to Brakke,I describe our regularity results of recent yea
会议
In this talk,we will present some results on Oldroyd-B model.We first give the global solution to incompressible Oldroyd-B model with non-small coupling con
会议
We discuss the development of asymptotic stable and consistent schemes in the joint quasi-neutral and fluid limits for the collisional Vlasov-Poisson system
会议
For a hypergraph H,let δ1(H)denote the minimum number of edges of H containing a given vertex,and υ(H)denote the maximum size of a matching in H.
会议
Combinatorics is a fundamental discipline of modern mathematics which studies discrete objects and their properties.This minisymposium we propose will focus
会议
We discuss relevant issues to obtain high performance for solvers and especially preconditioners on GPUs.
会议