Hehui Wu

From MaRDI portal
(Redirected from Person:322347)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The total Betti number of the independence complex of ternary graphs
Journal of the European Mathematical Society (JEMS)
2025-02-07Paper
List-avoiding orientations
Combinatorica
2025-01-14Paper
Partitioning graphs with linear minimum degree
Random Structures & Algorithms
2024-10-24Paper
The inducibility of oriented stars
Journal of Combinatorial Theory. Series B
2024-07-01Paper
Graph partitions under average degree constraint
Journal of Combinatorial Theory. Series B
2024-01-15Paper
Partitioning graphs with linear minimum degree2023-06-13Paper
Proper orientations and proper chromatic number
Journal of Combinatorial Theory. Series B
2023-05-02Paper
Triangle-free subgraphs with large fractional chromatic number
Combinatorics, Probability and Computing
2023-03-31Paper
Subgraphs of Kneser graphs with large girth and large chromatic number
The Art of Discrete and Applied Mathematics
2022-12-19Paper
List-avoiding orientations2022-09-19Paper
On the Turán number of the linear \(3\)-graph \(C_{13}\)
The Electronic Journal of Combinatorics
2022-09-06Paper
Fractional chromatic number of a random subgraph
Journal of Graph Theory
2022-03-31Paper
1-subdivisions, the fractional chromatic number and the Hall ratio
Combinatorica
2021-04-16Paper
The Betti Number of the Independence Complex of Ternary Graphs2020-11-22Paper
A Ramsey Type problem for highly connected subgraphs2020-08-20Paper
The inducibility of oriented stars2020-08-12Paper
Coloring tournaments: from local to global
Journal of Combinatorial Theory. Series B
2019-07-17Paper
Weak duality for packing edge-disjoint odd \((u, v)\)-trails
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Word-representability of split graphs
(available as arXiv preprint)
2017-09-27Paper
Large Supports are required for Well-Supported Nash Equilibria
(available as arXiv preprint)
2017-08-31Paper
The extremal function for disconnected minors
Journal of Combinatorial Theory. Series B
2017-08-22Paper
The extremal function for disconnected minors
Journal of Combinatorial Theory. Series B
2017-08-22Paper
Dichromatic number and fractional chromatic number
Forum of Mathematics, Sigma
2017-04-04Paper
Triangle-free subgraphs with large fractional chromatic number
(available as arXiv preprint)
2016-10-14Paper
Interval minors of complete bipartite graphs
Journal of Graph Theory
2016-08-12Paper
A proof of a conjecture of Ohba
Journal of Graph Theory
2015-05-22Paper
A proof of a conjecture of Ohba
Journal of Graph Theory
2015-05-22Paper
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
European Journal of Combinatorics
2014-10-08Paper
Decomposition of sparse graphs into forests and a graph with bounded degree
Journal of Graph Theory
2013-11-15Paper
Complete minors, independent sets, and chordal graphs
Discussiones Mathematicae. Graph Theory
2012-09-05Paper
Packing of Steiner trees and \(S\)-connectors in graphs
Journal of Combinatorial Theory. Series B
2012-03-19Paper
Regular matroids without disjoint circuits.2012-02-20Paper
Longest cycles in \(k\)-connected graphs with given independence number
Journal of Combinatorial Theory. Series B
2011-12-08Paper
Every 3-connected, essentially 11-connected line graph is Hamiltonian2010-07-30Paper
The hub number of a graph
Information Processing Letters
2010-06-09Paper
Optimal strong parity edge-coloring of complete graphs
Combinatorica
2009-12-28Paper
On mod \((2p+1)\)-orientations of graphs
Journal of Combinatorial Theory. Series B
2009-03-04Paper
scientific article; zbMATH DE number 5237271 (Why is no real title available?)
(available as arXiv preprint)
2008-02-20Paper
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory. Series B
2006-07-12Paper


Research outcomes over time


This page was built for person: Hehui Wu