Fan Chung Graham

	Papers of Fan Chung - (back to the full list)	[ Erdös \| eigen \| graphs \| extremal \| random \| powerlaw ] [ algorithm \| geometry \| number theory \| Internet \| surveys ] Keyword search:

2016-present,

2011-2015,

2006-2010,

2001-2005,

1996-2000,

1991-1995,

1986-90,

1981-85,

1976-80,

1973-75

2016-present

A random graph model for clustering graphs , Proceeding of the 18th Workshop on Algorithms and Models for the Web Graph (WAW 2023), Lecture Notes in Computer Science 13894, Springer, 2023, pp. 112-126,
(with Nick Sieger).

Quasi-random influences of Boolean functions , preprint,
(with Nick Sieger).

Fan-complete Ramsey numbers , preprint,
(with Qizhong Lin).

Forest formulas of discrete Green's functions, J. of Graph Theory, 102, (2023), 556-577,
(with Ji Zeng).

Slow Fibonacci walks, Journal of Number Theory, 210, (2020), 142--170,
(with Ron Graham and Sam Spiro)

Well dispersed sequences in [0,1]^d , J. Number Theory, 189, (2018), 1--24,
(with Ron Graham)

On the discrepancy of circular sequences of reals, J. Number Theory, 164 (2016), 52--65,
(with R. L. Graham).

2011-2015

2006-2010 Back to top

Universal juggling cycles,
Integers, Combinatorial Number Theory, B. Landman, M.B. Nathanson, J. Nesetril, R.J. Nowakowski, C. Pomerance, eds. (2007), 121-130. Also appeared in INTEGERS 7(2) (2007), A8 (electronic) 10 pp.
(with Ron Graham).
Complex Graphs and Networks,
CBMS Number 107, AMS Publications, 2006, vii+264pp., (with L. Lu)

2001-2005 Back to top

De Bruijn cycles for covering codes,
Random Structures and Algorithms, 25, (2004), 421--431,
(with J. Cooper).
On sparse sets hitting linear forms, abstract,
Number Theory for the Millennium I, (Eds. M. A. Bennett et al.), AK Peters, Natick, Massachusetts, (2002), 257--272.
(with Paul Erdös and Ronald Graham)

1996-2000 Back to top

The maximum upper density of a set of positive real numbers with no solution s to x+y=kz,
in Paul Erdos and his mathematics (Budapest, 1999), Janos Bolyai Math. Soc., Budapest, 1999, 54--56,
(with John L. Goldwasser).
An upper bound for the Turan number t₃(n,4),
Journal of Combinatorial Theory (A) 87 (1999), 381--389,
(with Linyuan Lu).
Logarithmic Sobolev techniques for random walks on graphs,
Emerging Applications of Number Theory, IMA Volumes in Math. and its Applications 109 (eds. D. A. Hejhal et. al.), 175--186, Springer, 1999.
Spectral Graph Theory, (first four chapter)
CBMS Number 92, AMS Publications, 1997, xii+207 pp.
Integer sets containing no solutions to x+y=3z,
in The Mathematics of Paul Erdos, Springer Verlag, Berlin (1997), 218--227,
(with John L. Goldwasser).
Optical wavelength routing, translation, and packet/cell switched networks,
Journal of Lightwave Technology 14, Issue 3, March 1996, 336--343,
(with Krishna Bala and Charles A. Brackett).
Maximum subsets of $(0,1]$ with no solutions to $x+y=kz$,
Electronic Journal of Combinatorics 3 (1996) R1, 23 pp,
(with John L. Goldwasser).

1991-1995 Back to top

Several generalizations of Weil's sums, J. of Number Theory 49 (1994) 95--106.
A note on constructive lower bounds for the Ramsey numbers R(3,t),
J. Comb. Theory (B) 57 (1993), 150--155,
(with R. Cleve and P. Dagum).
The number of different distances determined by a set of points in the Euclidean place,
Discrete and Computational Geometry 7 (1992), 1--11,
(with E. Szemeredi and W.T. Trotter).

1986-1990 Back to top

The Maximum number of edges in 2K₂-free graphs of bounded degree,
Discrete Math. 81 (1990), 129--135,
(with A. Gyarfas, W. T. Trotter and Z. Tuza).
On the fractional covering number of hypergraphs,
SIAM J. on Discrete Math. 1 (1988), 45--49,
(with Z. Furedi, M. R. Garey and R. L. Graham).
The average distance and the independence number,
J. Graph Theory 12 (1988), 229--235.
The maximum number of edges in a 3-graph not containing a given star,
Graphs and Combinatorics 3 (1987), 111--126,
(with P. Frankl).
Diameters of graphs: old problems and new results,
Congressus Numerantium 60 (1987), 295--317.
Random walks arising in random number generation,
Ann. Probab. 15 (1987), no. 3, 1148--1165,
(with P. Diaconis and R.L. Graham).

1981-1985 Back to top

Coding strings by pairs of strings,
SIAM J. Algebraic Discrete Methods 6 (1985), no. 3, 445--461,
also in Proceedings of the fourteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1983) Congr. Numer. 39 (1983), 183--191,
(with R.E. Tarjan, W.J. Paul, and R. Reischuk).
The number of different distances determined by n points in the plane,
J. Combin. Theory Ser. (A) 36 (1984), no. 3, 342--354.
A survey of bounds for classical Ramsey numbers,
J. Graph Theory 7 (1983), no. 1, 25--37,
(with C.M. Grinstead)
On the minimum dominating pair number of a class of graphs,
Caribbean J. Math. 1 (1982), no. 2, 73--76,
(with R.L. Graham, E.J. Cockayne, and D.J. Miller).
The number of relation graphs,
Bell Laboratories Internal Memorandum, 1982,
(with F. K. Hwang and D. H. Krantz).
Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs,
Finite and infinite sets, Vol. I, II (Eger, 1981), 171--179, Colloq. Math. Soc. János Bolyai 37, North-Holland, Amsterdam, 1984,
(with P. Erdös and R. L. Graham).
A note on constructive methods for Ramsey numbers,
J. Graph Theory 5 (1981), 109--113.

1975-1980 Back to top

On the product of the point and line covering numbers of a graph,
Annals of the New York Academy of Sciences 319 (1979), 597--602,
(with P. Erdös and R. L. Graham).
The number of Baxter permutations,
J. Comb. Th. (A) 24 (1978), 382--394, (with R. L. Graham, V. E. Hoggatt, and M. Kleiman).

1973-1975 Back to top

On multicolor Ramsey numbers for complete bipartite graphs,
J. Comb. Th. (B) 18 (1975), 164--169,
(with R. L. Graham).
On triangular and cyclic Ramsey numbers with k colors,
Graphs and Combinatorics, Lecture Notes, No. 406, (1974), 236--242, Springer-Verlag, New York.
On the Ramsey numbers N(3,3,...,3;2),
Discrete Math. 5 (1973), 317-321.

<< Back to Research Home

¨ 2000-2006 Fan Chung Graham