Guofei Zhou

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Constructing a Family of 4‐Critical Planar Graphs with High Edge Density	2017	Tianxing Yao Guofei Zhou
+	All Quadrilateral-Wheel Planar Ramsey Numbers	2017	Yaojun Chen Zhengke Miao Guofei Zhou
+	All Complete Graph-Wheel Planar Ramsey Numbers	2015	Yanbo Zhang Guofei Zhou Yaojun Chen
+	Constructing a Family of 4-Critical Planar Graphs with High Edge-Density	2015	Tianxing Yao Guofei Zhou
+	Some New Methods for Constructing 4-critical Planar Graphs	2015	Guofei Zhou
+ PDF Chat	On vertex independence number of uniform hypergraphs	2014	T. A. Chishti Guofei Zhou S. Pirzada Antal Iványi
+	The planar Ramsey number<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>	2014	Yaojun Chen T.C.E. Cheng Yunqing Zhang Guofei Zhou
+	Planar Ramsey Numbers of Four Cycles Versus Wheels	2013	Yaojun Chen Zhengke Miao Guofei Zhou
+ PDF Chat	A note on planar Ramsey numbers for a triangle versus wheels	2012	Guofei Zhou Yaojun Chen Zhengke Miao S. Pirzada
+	Score lists in multipartite hypertournaments	2010	S. Pirzada Guofei Zhou Antal Iványi
+	On k-hypertournament losing scores	2010	S. Pirzada Guofei Zhou
+	Score lists in (h,k)-bipartite hypertournaments	2007	S. Pirzada Guofei Zhou
+	Note on the degree sequences of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-hypertournaments	2007	Chao Wang Guofei Zhou
+	New proof of a Theorem on k-hypertournament losing scores	2006	S. Pirzada Guofei Zhou
+	Independence numbers of hypergraphs with sparse neighborhoods	2003	Guofei Zhou Yusheng Li
+	Cycles Containing a Given Arc in Regular Multipartite Tournaments	2002	Guofei Zhou Kemin Zhang
+	LOCALIZATION THEOREM ON HAMILTONIAN GRAPHS	2000	Linqiang Pan Kemin Zhang Guofei Zhou
+	A note on hypertournaments	1999	Linqiang Pan Guofei Zhou Kemin Zhang

Common Coauthors

Coauthor	Papers Together
S. Pirzada	6
Yaojun Chen	5
Kemin Zhang	3
Zhengke Miao	3
Antal Iványi	2
Tianxing Yao	2
Linqiang Pan	2
T. A. Chishti	1
Yunqing Zhang	1
Yusheng Li	1
Chao Wang	1
Yanbo Zhang	1
T.C.E. Cheng	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Planar Ramsey Numbers	1993	Richard Steinberg Craig A. Tovey	5
+	The Analogue of Ramsey Numbers for Planar Graphs	1969	K. Walker	5
+ PDF Chat	Planar Ramsey numbers for cycles	2007	Izolda Gorgol Andrzej Ruciński	4
+ PDF Chat	A note on planar Ramsey numbers for a triangle versus wheels	2012	Guofei Zhou Yaojun Chen Zhengke Miao S. Pirzada	3
+	On 4-critical planar graphs with high edge density	1991	Gerhard Koester	3
+	Note on the degree sequences of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-hypertournaments	2007	Chao Wang Guofei Zhou	3
+	Improved lower bounds on <i>k</i>‐independence	1991	Yair Caro Źsolt Tuza	2
+ PDF Chat	A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs	1999	Halina Bielak	2
+	A Dense Infinite Sidon Sequence	1981	Miklós Ajtai János Komlós Endre Szemerédi	2
+	Small Ramsey Numbers	2011	Stanisław Radziszowski	2
+	On k-hypertournament losing scores	2010	S. Pirzada Guofei Zhou	2
+	On Book-Complete Graph Ramsey Numbers	1996	Yusheng Li Cecil Rousseau	2
+	The Ramsey numbers for cycles versus wheels of even order	2009	Lianmin Zhang Yaojun Chen T.C.E. Cheng	2
+	A note on Hamiltonian circuits	1972	Vašek Chvátal P. Erdős	2
+	A note on the independence number of triangle-free graphs	1983	James B. Shearer	2
+	A note on Ramsey numbers	1980	Miklós Ajtai János Komlós Endre Szemerédi	2
+ PDF Chat	On Turán’s theorem for sparse graphs	1981	Miklós Ajtai Paul Erdős János Komlós Endre Szemerédi	2
+	A sufficient condition for all short cycles	1997	Stephan Brandt	2
+ PDF Chat	A new upper bound for diagonal Ramsey numbers	2009	David Conlon	2
+	Linear trees in uniform hypergraphs	2013	Zoltán Füredi	1
+	Independent sets and matchings in subcubic graphs	2012	Michael A. Henning Christian Löwenstein Dieter Rautenbach	1
+	A fast and simple randomized parallel algorithm for the maximal independent set problem	1986	Noga Alon László Babai Alon Itai	1
+	Independence numbers of hypergraphs with sparse neighborhoods	2003	Guofei Zhou Yusheng Li	1
+	Random Hypergraph Processes with Degree Restrictions	2004	Catherine Greenhill Andrzej Ruciński Nicholas Wormald	1
+ PDF Chat	Hypergraph domination and strong independence	2009	Bibin K. Jose Źsolt Tuza	1
+	Vertex coloring acyclic digraphs and their corresponding hypergraphs	2008	Geir Agnarsson Ágúst S. Egilsson Magnús M. Halldórsson	1
+	Perfect matchings in uniform hypergraphs with large minimum degree	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi	1
+ PDF Chat	Sur le problème des courbes gauches en Topologie	1930	Casimir Kuratowski	1
+	Hypergraphs - Combinatorics of Finite Sets	1989	Claude Berge	1
+	A Probabilistic lower bound on the independence number of graphs	1994	Stanley M. Selkow	1
+ PDF Chat	A New Lower Bound on the Independence Number of a Graph and Applications	2014	Michael A. Henning Christian Löwenstein Justin Southey Anders Yeo	1
+	Lower bounds on the independence number in terms of the degrees	1983	Jerrold R. Griggs	1
+	The planar Ramsey number <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="italic"><mml:mi>PR</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>	2007	Yongqi Sun Yuansheng Yang Lin Xiaohui Yanan Song	1
+	Reconstruction of complete interval tournaments. II	2010	Antal Iványi	1
+	ON THE INDEPENDENCE NUMBERS OF COMPLEMENTARY GRAPHS	1974	Gary Chartrand Seymour Schuster	1
+	Gallai theorems for graphs, hypergraphs, and set systems	1988	E. J. Cockayne Stephen T. Hedetniemi Renu Laskar	1
+ PDF Chat	New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs	2012	Kunal Dutta Dhruv Mubayi C. R. Subramanian	1
+	An analytic theory of extremal hypergraph problems	2013	Vladimir Nikiforov	1
+	On the orientation of graphs	1980	András Frank	1
+	Finding and counting cliques and independent sets in r-uniform hypergraphs	2006	Raphael Yuster	1
+	A note on greedy algorithms for the maximum weighted independent set problem	2002	Shuichi Sakai Mitsunori Togasaki Koichi Yamazaki	1
+	Matchings in 3-uniform hypergraphs	2012	Daniela Kühn Deryk Osthus Andrew Treglown	1
+	Asymptotic Upper Bounds for Ramsey Functions	2001	Yusheng Li Cecil Rousseau Wenan Zang	1
+ PDF Chat	Differential Methods for Finding Independent Sets in Hypergraphs	2006	Yusheng Li Wenan Zang	1
+	Matching theory—a sampler: from Dénes König to the present	1992	Michael D. Plummer	1
+	The number of maximal independent sets in connected graphs	1987	Zoltán Füredi	1
+	The planar Ramsey number for C4 and K5 is 13	2001	Halina Bielak Izolda Gorgol	1
+	A lower bound on independence in terms of degrees	2011	Jochen Harant	1
+	Graphs and Matrices	2014	R. B. Bapat	1
+	Matchings and covers in hypergraphs	1988	Zoltán Füredi	1