Georgia State University

output

20022026

most citedEnergy Loss and Flow of Heavy Quarks in Au+Au Collisions at sqrt(s_NN) = 200 GeV

593 citations

researchers with a paper here

collaborating institutions

Showing 2014 · math.COShow all

5 papers · 2 filters

math.CO2014

Characterizing forbidden pairs for hamiltonian squares

Guantao Chen, Songling Shan

The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $C$ is a hamiltonian cycle of a gr…

math.CO2014★ 5 cited

Minimum degree thresholds for bipartite graph tiling

Albert Bush, Yi Zhao

For any bipartite graph $H$ , we determine a minimum degree threshold for a balanced bipartite graph $G$ to contain a perfect $H$ -tiling. We show that this threshold is best possibl…

math.CO2014★ 11 cited

Edge-connectivity in regular multigraphs from eigenvalues

Suil O

Let $G$ be a $d$ -regular multigraph, and let $λ_{2} (G)$ be the second largest eigenvalue of $G$ . In this paper, we prove that if $λ_{2} (G) < \frac{d - 1 + 9 d ^{2} - 10 d + 17}{4}$ , then $G$ i…

math.CO2014★ 1 cited

Vizing's 2-factor Conjecture Involving Large Maximum Degree

Guantao Chen, Songling Shan

Let $G$ be a connected simple graph of order $n$ and let $Δ (G)$ and $χ^{'} (G)$ denote the maximum degree and chromatic index of $G$ , respectively. Vizing proved that $χ^{'} (G) = Δ (G)$ or $…

math.CO2014★ 27 cited

Near Perfect Matchings in $k$ -uniform Hypergraphs

Jie Han

Let $H$ be a $k$ -uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$ . We prove that if the minimum $(k - 1)$ -degree of $H$ is at least $…

Characterizing forbidden pairs for hamiltonian squares

Minimum degree thresholds for bipartite graph tiling

Edge-connectivity in regular multigraphs from eigenvalues

Vizing's 2-factor Conjecture Involving Large Maximum Degree

Near Perfect Matchings in k-uniform Hypergraphs

Near Perfect Matchings in $k$ -uniform Hypergraphs