Bo Ning

Longest cycles and Dirac-type results in highly connected graphs

Jie Ma, Bo Ning, Ziyuan Zhao

A classical theorem of Nash-Williams states that if $G$ is a $2$ -connected graph on $n$ vertices with minimum degree at least $(n + 2) /3$ , then for every longest cycle $C$ of $G$ , th…

Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions

Bo Ning, Shenggui Zhang, Binlong Li

A graph $G$ is called \emph{claw-o-heavy} if every induced claw ( $K_{1, 3}$ ) of $G$ has two end-vertices with degree sum at least $∣ V (G) ∣$ in $G$ . For a given graph $R$ , $G$ is call…

A note on nowhere-zero 3-flow and Z_3-connectivity

Fuyuan Chen, Bo Ning

There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conject…

On some papers of Nikiforov

Bo Ning

The well known Mantel's Theorem states that a graph on $n$ vertices and $m$ edges contains a triangle if $m > \frac{n ^{2}}{4}$ . Nosal proved that every graph on $m$ edges contains a tr…

Hamilton cycles in almost distance-hereditary graphs

Bing Chen, Bo Ning

Let $G$ be a graph on $n \geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H} (x, y) \leq d_{G} (x, y) + 1$ for…

Two sufficient conditions for the existence of Hamilton cycles in graphs

Bo Ning, Bing Chen, Shenggui Zhang

Let $G$ be a graph on $n \geq 3$ vertices, claw the bipartite graph $K_{1, 3}$ , and $Z_{i}$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ …

The RandiÄ index and signless Laplacian spectral radius of graphs

Bo Ning, Xing Peng

Given a connected graph $G$ , the RandiÄ index $R (G)$ is the sum of $\frac{1}{d ( u ) d ( v )}$ over all edges ${u, v}$ of $G$ , where $d (u)$ and $d (v)$ are the degree of vertices…

Eigenvalues and triangles in graphs

Huiqiu Lin, Bo Ning, Baoyindureng Wu

BollobÃ¡s and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r + 1}$ -free graph on at least $r + 1$ vertices and $m$ edges, then $…

Counting rainbow triangles in edge-colored graphs

Xueliang Li, Bo Ning, Yongtang Shi +1

Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$ , denoted by $I^´^{c} (G)$ , is defined as the minimum number of colors assigned to the edges incident t…

On the chromatic profile for tripartite graphs and beyond

Bo Ning, Jian Wang, Yisai Xue

Let $H$ be a graph and let $I^´_{I ¨} (H, r)$ denote the infimum of $c$ such that every $H$ -free graph with minimum degree at least $c n$ is $r$ -colorable. The \textit{chromatic profile}…

On degree power sum in $P_{k}$ -free graphs

Jiangdong Ai, Fankang He, Yihang Liu +1

Let $G$ be a graph on $n$ vertices with degree sequence $(d_{1}, d_{2} ...... d_{n})$ . For a real $p \geq 1$ , let $D_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . A TurÃ¡n-type problem of degree power sum was i…

hep-th2017

Pseudo-topological Quasi-local Energy of Torsion Gravity

Sheng-Lan Ko, Feng-Li Lin, Bo Ning

Torsion gravity is a natural extension to Einstein gravity in the presence of the fermion matter sources. In this paper we adopt Wald's covariant method of Noether charge to constr…

Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs

Binlong Li, Bo Ning

In 1962, ErdÅs proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipart…

Heavy subgraphs, stability and hamiltonicity

Binlong Li, Bo Ning

Let $G$ be a graph. Adopting the terminology of Broersma et al. and Äada, respectively, we say that $G$ is 2-heavy if every induced claw ( $K_{1, 3}$ ) of $G$ contains two end-vertic…

Rainbow triangles sharing one common vertex or edge

Xiaozheng Chen, Bo Ning

Let $G$ be an edge-colored graph on $n$ vertices. For a vertex $v$ , the \emph{color degree} of $v$ in $G$ , denoted by $d^{c} (v)$ , is the number of colors appearing on the edges incid…

math.NT2013

An inductive proof of Straub's q-analogue of Ljunggren's congruence

Bo Ning

Recently, Straub gave an interesting $q$ -analogue of a binomial congruence of Ljunggren. In this note we give an inductive proof of his result.

hep-th2024

Violation of Weak Cosmic Censorship in de Sitter Space

Feng-Li Lin, Bo Ning

Inspired by the recent discovery of a violation of strong cosmic censorship (SCC) for the near-extremal Reissner-NordstrÃ¶m black holes in de Sitter space (RN-dS), we investigate i…

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

Hongliang Lu, Bo Ning

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent…

On derivatives and higher-order derivatives of chromatic polynomials

Bo Ning, Yan Yang

Let $ G $ be a graph of order $ n $ with maximum degree $I^$ , and let $P (G, x)$ denote its chromatic polynomial. We investigate several properties of $P (G, x)$ related to its der…

Rainbow triangles in edge-colored graphs

Binlong Li, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. The color degree of a vertex $v$ of $G$ , is defined as the number of colors of the edges incident to $v$ . The color number of $G$ is defined as th…

Extensions of ErdÅs's 1962 theorem on non-Hamiltonian graphs

Xu Liu, Bo Ning, Tao Wang

For a positive integer $k$ , a graph property $H$ , and a graph parameter $P$ , let $ex_{P} (n, H; I^´ \geq k)$ denote the maximum…

math.CO2011

Long paths and cycles passing through specified vertices under the average degree condition

Binlong Li, Bo Ning, Shenggui Zhang

Let $G$ be a $k$ -connected graph with $k \geq 2$ . In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$ , it contains a path passing through its any $k - 2$ {…

On path-quasar Ramsey numbers

Binlong Li, Bo Ning

Let $G_{1}$ and $G_{2}$ be two given graphs. The Ramsey number $R (G_{1}, G_{2})$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_{1}$ or $\ove…

math.CO2022

A revisit to Bang-Jensen-Gutin conjecture and Yeo's theorem

Ruonan Li, Bo Ning

A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of…

math.CO2019

On sufficient conditions for rainbow cycles in edge-colored graphs

Shinya Fujita, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges of $G$ and the number of colors appearing on $E (G)$ , respectively. For a vertex $v \in V (G)$ …

stat.ME2017

Bayesian inference for generalized extreme value distribution with Gaussian copula dependence

Bo Ning, Peter Bloomfield

Dependent generalized extreme value (dGEV) models have attracted much attention due to the dependency structure that often appears in real datasets. To construct a dGEV model, a na…

Localized and weighted versions of extremal problems

Binlong Li, Bo Ning

Malec and Tompkins (EUJC, 2023) considered the localized versions of TurÃ¡n-type problems, and proved a localized theorem on ErdÅs-Gallai Theorem on paths. Zhao and Zhang (JGT, 20…

Extremal problems of ErdÅs, Faudree, Schelp and Simonovits on paths and cycles

Binlong Li, Jie Ma, Bo Ning

For positive integers $n > d \geq k$ , let $I ¨ (n, d, k)$ denote the least integer $I ¨ $ such that every $n$ -vertex graph with at least $I ¨ $ vertices of degree at least $d$ contains a path…

gr-qc2020

Gedanken Experiments to Destroy a BTZ Black Hole

Baoyi Chen, Feng-Li Lin, Bo Ning

We consider gedanken experiments to destroy an extremal or near-extremal BTZ black hole by throwing matter into the horizon. These black holes are vacuum solutions to (2+1)-dimensi…

Cyclability of $i d$ -cycles in graphs

Ruonan Li, Bo Ning, Shenggui Zhang

Let $G$ be a graph on $n$ vertices and $C^{'} = v_{0} v_{1} \dots v_{p - 1} v_{0}$ a vertex sequence of $G$ with $p \geq 3$ ( $v_{i} \neq = v_{j}$ for all $i, j = 0, 1, \dots, p - 1$ , $i \neq = j$ ). If for any succ…

hep-th2011

Boundary Conditions for NHEK through Effective Action Approach

Bin Chen, Bo Ning, Jia-ju Zhang

We study the asymptotic symmetry group(ASG) of the near horizon geometry of extreme Kerr black hole through the effective action approach developed in 1007.1031. By requiring a fin…

Rainbow C_4's and Directed C_4's: the Bipartite Case Study

Bo Ning, Jun Ge

In this paper we obtain a new sufficient condition for the existence of directed cycles of length 4 in oriented bipartite graphs. As a corollary, a conjecture of H. Li is confirmed…

A Strengthening of ErdÅs-Gallai Theorem and Proof of Woodall's Conjecture

Binlong Li, Bo Ning

For a 2-connected graph $G$ on $n$ vertices and two vertices $x, y \in V (G)$ , we prove that there is an $(x, y)$ -path of length at least $k$ if there are at least $\frac{n - 1}{2}$ vert…

math.CO2019

Exact bipartite TurÃ¡n numbers of large even cycles

Binlong Li, Bo Ning

Let the bipartite TurÃ¡n number $e x (m, n, H)$ of a graph $H$ be the maximum number of edges in an $H$ -free bipartite graph with two parts of sizes $m$ and $n$ , respectively. In this…

The stability method, eigenvalues and cycles of consecutive lengths

Binlong Li, Bo Ning

Woodall proved that for a graph $G$ of order $n \geq 2 k + 3$ where $k \geq 0$ is an integer, if $e (G) \geq (2 n - k - 1) + (2 k + 2) + 1$ then $G$ contains a $C_{ℓ}$ for each $\e…

Eigenvalues and cycles of consecutive lengths

Binlong Li, Bo Ning

As the counterpart of classical theorems on cycles of consecutive lengths due to Bondy and BollobÃ¡s in spectral graph theory, Nikiforov proposed the following open problem in 2008…

hep-th2014

Quantum Decoherence with Holography

Shih-Hao Ho, Wei Li, Feng-Li Lin +1

Quantum decoherence is the loss of a system's purity due to its interaction with the surrounding environment. Via the AdS/CFT correspondence, we study how a system decoheres when i…

Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs

Bo Ning

A graph $G$ on $n$ vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to $n$ . In 1984, Fan presented a degree condit…

Nikiforov's spectral consecutive cycle problem and the connected-matching method

Bo Ning, Mingqing Zhai

Let $I ¨ (G)$ denote the adjacency spectral radius of a graph $G$ of order $n$ . We determine the sharp constant in an open problem of Nikiforov (2008) on cycles of consecutive length…

Counting substructures and eigenvalues II: quadrilaterals

Bo Ning, Mingqing Zhai

Let $G$ be a graph and $I^» (G)$ be the spectral radius of $G$ . A previous result due to Nikiforov [Linear Algebra Appl., 2009] in spectral graph theory asserted that every graph $G$ …

Spectral radius and Hamiltonian properties of graphs

Bo Ning, Jun Ge

Let $G$ be a graph with minimum degree $I^´$ . The spectral radius of $G$ , denoted by $I ¨ (G)$ , is the largest eigenvalue of the adjacency matrix of $G$ . In this note we mainly prove…

The largest Laplacian eigenvalue of induced- $K_{1, r}$ -free graphs

Lele Liu, Bo Ning

Let $G$ be a simple graph of maximum degree $d$ , and let $I^¼ (G)$ denote the largest eigenvalue of its Laplacian matrix. For a fixed integer $k \geq 2$ , Aharoni, Alon, and Berger (20…

A new spectral TurÃ¡n theorem for weighted graphs and consequences

Lele Liu, Bo Ning

Confirming a conjecture of Elphick and Edwards and strengthening a spectral theorem of Wilf, Nikiforov proved that for any $K_{r + 1}$ -free graph $G$ , $I^» (G)^{2} \leq 2 (1 - 1/ r) m$ , w…

hep-th2009

On the low energy brane/anti-brane dynamics

J. X. Lu, Bo Ning, Guan-Nan Zhong

We study the dynamical behavior of a pair of Dp-brane and anti Dp-brane ( $0 \leq p \leq 6$ ) moving parallel to each other in the region where the brane and anti-brane annihilation…

Rainbow triangles in edge-colored graphs with large minimum color degree

Bo Ning, Yuting Tian

Let $G$ be an edge-colored graph on $n$ vertices, and let $\deltac(G)$ denote its minimum color degree. Li and, independently Li, Ning, Xu, and Zhang, proved that every edge-colore…

hep-th2013

Refined Holographic Entanglement Entropy for the AdS Solitons and AdS black Holes

Masafumi Ishihara, Feng-Li Lin, Bo Ning

We consider the refinement of the holographic entanglement entropy for the holographic dual theories to the AdS solitons and AdS black holes, including the corrected ones by the Ga…

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs

Bo Ning, Shenggui Zhang, Bing Chen

Let claw be the graph $K_{1, 3}$ . A graph $G$ on $n \geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$ , and…

A Complete Solution to the CvetkoviÄ-Rowlinson Conjecture

Huiqiu Lin, Bo Ning

In 1990, CvetkoviÄ and Rowlinson [The largest eigenvalue of a graph: a survey, Linear Multilinear Algebra 28(1-2) (1990), 3--33] conjectured that among all outerplanar graphs on $…

math.ST2019

Bayesian Linear Regression for Multivariate Responses Under Group Sparsity

Bo Ning, Seonghyun Jeong, Subhashis Ghosal

We study frequentist properties of a Bayesian high-dimensional multivariate linear regression model with correlated responses. The predictors are separated into many groups and the…

hep-th2016

Relative Entropy and Torsion Coupling

Feng-Li Lin, Bo Ning

We evaluate the relative entropy on a ball region near the UV fixed point of a holographic conformal field theory deformed by a fermionic operator of nonzero vacuum expectation val…

eess.IV2022

DXM-TransFuse U-net: Dual Cross-Modal Transformer Fusion U-net for Automated Nerve Identification

Baijun Xie, Gary Milam, Bo Ning +2

Accurate nerve identification is critical during surgical procedures for preventing any damages to nerve tissues. Nerve injuries can lead to long-term detrimental effects for patie…

stat.ME2018

Bayesian method for causal inference in spatially-correlated multivariate time series

Bo Ning, Subhashis Ghosal, Jewell Thomas

Measuring the causal impact of an advertising campaign on sales is an essential task for advertising companies. Challenges arise when companies run advertising campaigns in multipl…

A complete solution to the Boots-Royle/Cao-Vince conjecture

Lele Liu, Bo Ning, Yi Wang

Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge and a path on $n - 2$ vertices is the unique planar graph of maximum adjacency spectral radius…

Wiener index, Harary index and Hamiltonicity of graphs

Hongbo Hua, Bo Ning

In this paper, we prove tight sufficient conditions for traceability and Hamiltonicity of connected graphs with given minimum degree, in terms of Wiener index and Harary index. We…

math.CO2017

Coloring graphs with two odd cycle lengths

Jie Ma, Bo Ning

In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let $G$ be a graph and $L (G)$ be the set of all odd cycle lengths of $G$ . We prove that: (1) I…

An improved double-exponential lower bound for $r_{4} (5, n)$

Chunchao Fan, Mingze Li, Qizhong Lin +1

The Ramsey number $r_{k} (s, n)$ is the smallest integer $N$ such that every $N$ -vertex $k$ -graph contains either a copy of $K_{s}^{(k)}$ or an independent set of size $n$ . A well-known…

Variants of spectral TurÃ¡n theorems and eigenvectors of graphs

Lele Liu, Bo Ning

In 2002, Nikiforov proved that for an $n$ -vertex graph $G$ with clique number $I ¨ $ and edge number $m$ , the spectral radius $I^» (G)$ satisfies $I^» (G) \leq 2 (1 - 1/ I ¨ ) m$ , whi…

Exact TurÃ¡n numbers of two vertex-disjoint paths

Miao Dong, Bo Ning, Long-Tu Yuan +1

The TurÃ¡n number of a graph $H$ is the maximum number of edges in any graph of order $n$ that does not contain $H$ as a subgraph. In 1959, Erd\H os and Gallai obtained a sharp upp…

math.CA2016

On a conjecture of Chen-Guo-Wang

Bo Ning, Yu Zheng

Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n $t h$ Bernoulli number, Chen, Guo and Wang proposed a conjecture about the l…

Stability in Bondy's theorem on paths and cycles

Bo Ning, Long-tu Yuan

In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one verte…

hep-th2021

Quasi-local Energy in 3D Gravity with Torsion

Cheng-Hao Wei, Bo Ning

We show that for generic stationary spacetime and specific Killing fields, Wald's approach for quasi-local energy could be generalized to the first order formalism straightforwardl…

On Scott's odd induced subgraph conjecture and a related problem

Bo Ning

For a graph $G$ , let $f_{o} (G)$ denote the maximum order of an induced subgraph of $G$ all of whose vertices have odd degree, and let $I ¨ (G)$ denote the chromatic number of $G$ . Scot…

math.CO2019

Spectral radius and Hamiltonian properties of graphs, II

Jun Ge, Bo Ning

In this paper, we first present spectral conditions for the existence of $C_{n - 1}$ in graphs (2-connected graphs) of order $n$ , which are motivated by a conjecture of ErdÅs. Then…

Counting triangles in graphs with no wheels of order at least five

Chunyang Dou, Bo Ning, Xing Peng

For a family of graphs $F$ , a graph $G$ is said to be $F$ -free if it contains no member of $F$ as a subgraph. A wheel graph $W_{k}$ is a graph on $k + 1$ ver…

Two problems of Burr, Erd\H os, Graham, and SÃ³s on maximal anti-Ramsey functions for $P_{4}$

Mingze Li, Bo Ning, Tianying Xie

Burr, Erd\H os, Graham, and SÃ³s introduced the maximal anti-Ramsey function $I ¨ _{S} (n, e, L)$ , the minimum number of colors required over all $n$ -vertex graphs with at leas…

The stability of independence polynomials of complete bipartite graphs

Guo Chen, Bo Ning, Jianhua Tu

The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane ${z \in C : Re (z) \leq 0}$ , and the graph itse…

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs

Changchang Dong, Mei Lu, Jixiang Meng +1

Given a graph $T$ and a family of graphs $F$ , the maximum number of copies of $T$ in an $F$ -free graph on $n$ vertices is called the generalized TurÃ¡n number,…

The formula for TurÃ¡n number of spanning linear forests

Bo Ning, Jian Wang

Let $F$ be a family of graphs. The TurÃ¡n number $e x (n; F)$ is defined to be the maximum number of edges in a graph of order $n$ that is $F$ -free. In 1…

The number of edges in graphs with bounded clique number and circumference

Chunyang Dou, Bo Ning, Xing Peng

Let $H$ be a family of graphs. The TurÃ¡n number $ex (n, H)$ is the maximum possible number of edges in an $n$ -vertex graph which does not contain any member of $\c…

Spectral analogues of ErdÅs' and Moon-Moser's theorems on Hamilton cycles

Binlong Li, Bo Ning

In 1962, ErdÅs gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore's theorem. One year l…

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity

Bo Ning

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an…

hep-th2023

Weak Cosmic Censorship and Second Law of Black Hole Thermodynamics in Higher Derivative Gravity

Feng-Li Lin, Bo Ning, Yanbei Chen

Infalling matter may destroy a black hole and expose the naked singularity. Thus, Penrose proposed the weak cosmic censorship conjecture to avoid such a possibility. On the other h…

hep-th2011

Self-Dual Warped AdS $_{3}$ Black Holes

Bin Chen, Bo Ning

We study a new class of solutions of three-dimensional topological massive gravity. These solutions can be taken as non-extremal black holes, with their extremal counterparts being…

hep-th2009

Interaction between two non-threshold bound states

J. X. Lu, Bo Ning, Ran Wei +1

A general non-threshold BPS (F, D $_{p}$ ) (or (D $_{p - 2}$ , D $_{p}$ )) bound state can be described by a boundary state with a quantized world-volume electric (or magnetic) flux and is c…

Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs

Binlong Li, Bo Ning, Shenggui Zhang

Broersma and Veldman proved that every 2-connected claw-free and $P_{6}$ -free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and $P_{6}$ …

math.CO2012

A note on heterochromatic cycles of length 4 in edge-colored graphs

Bo Ning, Shenggui Zhang

Let $G$ be an edge-colored graph. A heterochromatic cycle of $G$ is one in which every two edges have different colors. For a vertex $v \in V (G)$ , let $C N (v)$ denote the set of colo…

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

Fengming Dong, Jun Ge, Helin Gong +3

The chromatic polynomial $P (G, x)$ of a graph $G$ of order $n$ can be expressed as $i = 1 \sum n (- 1)^{n - i} a_{i} x^{i}$ , where $a_{i}$ is interpreted as the number of broken-cycle…

Counting substructures and eigenvalues I: triangles

Bo Ning, Mingqing Zhai

Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start u…

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Roman Äada, Binlong Li, Bo Ning +1

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1, 3}$ . Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if e…

An exponentially small gap of the Perron vector on independent sets

Hongzhang Chen, Jianxi Li, Yongtao Li +2

A classical result of CioabÄ states that if $G$ is a connected graph with the unit Perron vector $x$ , then any independent set $S$ of $G$ satisfies $\sum_{v\in S} x_v^2 \…

math.CO2018

Extensions of ErdÅs-Gallai Theorem and Luo's Theorem with Applications

Bo Ning, Xing Peng

The famous ErdÅs-Gallai Theorem on the TurÃ¡n number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2 m}{n}$ edges. In this n…

hep-th2009

Real-time correlators in warped AdS/CFT correspondence

Bin Chen, Bo Ning, Zhi-bo Xu

We study real-time correlators in the warped AdS/CFT correspondence. We apply the prescription used in the usual AdS/CFT correspondence and obtain the retarded Green's functions fo…

astro-ph.EP2018

Predicting Exoplanets Mass and Radius: A Nonparametric Approach

Bo Ning, Angie Wolfgang, Sujit Ghosh

A fundamental endeavor in exoplanetary research is to characterize the bulk compositions of planets via measurements of their masses and radii. With future sample sizes of hundreds…

Cycle lengths and chords under chromatic and degree constraints

Xiaozheng Chen, Bo Ning

We mainly consider three problems on cycle lengths and cycles with chords in graphs: (a) Gao, Huo, and Ma \cite[Question~1.5]{GaoHuoMa2021} asked whether, for every fixed $k \geq 3$ ,…

Graph operations and a unified method for kinds of TurÃ¡n-type problems on paths, cycles and matchings

Jiangdong Ai, Hui Lei, Bo Ning +1

Let $G$ be a connected graph and $P (G)$ a graph parameter. We say that $P (G)$ is feasible if $P (G)$ satisfies the following properties: (I) $\mathcal{…

cs.DB2025

Efficient Size Constraint Community Search over Heterogeneous Information Networks

Xinjian Zhang, Lu Chen, Chengfei Liu +2

The goal of community search in heterogeneous information networks (HINs) is to identify a set of closely related target nodes that includes a query target node. In practice, a siz…

physics.optics2014

Long-term Stabilization of Fiber Laser Using Phase-locking Technique with Ultra-low Phase Noise and Phase Drift

Dong Hou, Bo Ning, Shuangyou Zhang +2

We review the conventional phase-locking technique in the long-term stabilization of the mode-locked fiber laser and investigate the phase noise limitation of the conventional tech…

cs.DM2024

Monitoring the edges of product networks using distances

Wen Li, Ralf Klasing, Yaping Mao +1

Foucaud {\it et al.} recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Let $G$ be a graph with vertex set $V (G)$ , $M$ …

astro-ph.EP2019

Mass-Radius relationship for M dwarf exoplanets: Comparing nonparametric and parametric methods

Shubham Kanodia, Angie Wolfgang, Gudmundur K. Stefansson +2

M dwarfs, though the most abundant star in the galaxy, form only a small subset of stellar hosts with exoplanets with measured radii and masses. In this paper we analyze the Mass-R…

math.CO2018

Extremal problems on the Hamiltonicity of claw-free graphs

Binlong Li, Bo Ning, Xing Peng

In 1962, ErdÅs proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^…

Spectral radius and traceability of connected claw-free graphs

Bo Ning, Binlong Li

Let $G$ be a connected claw-free graph on $n$ vertices and $G$ be its complement graph. Let $I^¼ (G)$ be the spectral radius of $G$ . Denote by $N_{n - 3, 3}$ the graph consis…

Two conjectures on vertex-disjoint rainbow triangles

Xu Liu, Bo Ning, Yuting Tian

In 1963, Dirac proved that every $n$ -vertex graph has $k$ vertex-disjoint triangles if $n \geq 3 k$ and minimum degree $I^´ (G) \geq \frac{n + k}{2}$ . The base case $n = 3 k$ can be reduced…

An Improved Interpolation Theorem and Disproofs of Two Conjectures on 2-Connected Subgraphs

Haiyang Liu, Bo Ning

We prove that any $2$-connected graph $G$ on $n$ vertices with minimum degree $Î´(G) \ge \frac{n}{4}+2$ contains a $2$-connected subgraph of order $k$ for every integer…

gr-qc2021

Constraints on low-energy effective theories from weak cosmic censorship

Baoyi Chen, Feng-Li Lin, Bo Ning +1

We examine the weak cosmic censorship conjecture (WCCC) for the extremal charged black hole in possible generalizations of Einstein-Maxwell theory due to the higher order correctio…

Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

Bo Ning

In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x, y$ and $w, z$ we h…

On spectral TurÃ¡n theorems: confirming a conjecture of Guiduli and two problems of Nikiforov

Lele Liu, Bo Ning

Let $G$ be an $n$ -vertex graph, and let $I^» (G)$ and $I^»_{n} (G)$ denote the largest and smallest eigenvalues of its adjacency matrix. Write $e (G)$ for the number of edges of $G$ , $d(G…

On the two problems in Ramsey achievement games

Zhong Huang, Yusuke Kobayashi, Yaping Mao +2

Let $p, q$ be two integers with $p \geq q$ . Given a finite graph $F$ with no isolated vertices, the generalized Ramsey achievement game of $F$ on the complete graph $K_{n}$ , denoted by…

math.ST2019

Empirical priors and coverage of posterior credible sets in a sparse normal mean model

Ryan Martin, Bo Ning

Bayesian methods provide a natural means for uncertainty quantification, that is, credible sets can be easily obtained from the posterior distribution. But is this uncertainty quan…

hep-th2011

Holographic Q-picture of Kerr-Newman-AdS-dS Black Hole

Bin Chen, Chiang-Mei Chen, Bo Ning

In this article, we show that a four-dimensional Kerr-Newman-AdS-dS black hole could be described by two different holographic two-dimensional conformal field theories. The first d…