|
2016-present
-
Subgraph counts in
random clustering graphs,
Proceeding of the 19th Workshop on Algorithms and Models for the Web Graph (WAW 2024),
Lecture Notes in Computer Science 14671, Springer, 2024,
pp. 1-16,
(with Nick Sieger).
-
The spectral gap of graphs arising from substring reversals, The Electronic J. of Combinatorics, 24, no. 3 (2017), #P.3.4,
(with J. Tobin)
2011-2015
2006-2010
Back to top
2001-2005
Back to top
1996-2000
Back to top
-
Spanning trees in subgraphs of lattices,
Comtempory Math. 245, Amer. Math. Soc., Providence, R. I., 1999, 201--219.
-
An upper bound for the Turan number t3(n,4),
Journal of Combinatorial Theory (A) 87 (1999), 381--389,
(with Linyuan Lu).
-
Eigenvalue inequalities for graphs and convex subgraphs,
Communications on Analysis and Geometry 5 (1997), 575--623,
(with S.-T. Yau).
-
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
-
A Harnack inequality for homogeneous graphs and subgraphs,
Communications on Analysis and Geometry 2
(1994), 627--640,
also in Turkish J. Math. 19 (1995), 273--290,
(with S.-T. Yau).
-
On hypergraphs having evenly distributed subhypergraphs,
Disc. Math. 111 (1993), 125--129,
(with Ron Graham).
-
Quasi-ransom
subsets of Zn,
J. Comb. Theory (A) 61 (1992), 64--86,
(with R. L. Graham).
-
Subgraphs of a hypercube containing no small even cycles,
J. Graph Theory 16 (1992), 273--286.
-
A note on finding a strict saddlepoint,
Amer. Math. Monthly 98 (1991), 418--419,
(with Daniel Bienstock, Michael Fredman, Alejandro A. Schaffer, Peter W. Shor and Subhash Suri).
1986-1990
Back to top
-
On graphs not containing prescribed induced subgraphs,
in A Tribute to Paul Erdos, Cambridge University Press (1990), 111--120,
(with R.L. Graham).
-
The Maximum number of edges in 2K2-free graphs of bounded degree,
Discrete Math. 81 (1990), 129--135,
(with A. Gyarfas, W. T. Trotter and Z. Tuza).
-
On induced subgraphs of the cube,
J. Comb. Th. (A) 49 (1988), 180--187,
(with Z. Furedi, R.L. Graham and P. Seymour).
-
Monotone subsequences in (0,1)-matrices,
Graphs Combin. 2 (1986), no. 1, 31--36,
(with P.C. Fishburn and V.K. Wei).
1981-1985
Back to top
-
Cross-monotone subsequences,
Order 1 (1985), no. 4, 351--369, (with P.C. Fishburn and V.K. Wei).
-
Extremal subgraphs for two graphs,
J. Combin. Theory (B) 38 (1985), no. 3, 248--260, (with P. Erdös and J. Spencer).
-
Edge-colored complete graphs with precisely colored subgraphs,
Combinatorica 3 (1983), no. 3-4, 315--324,
(with R.L. Graham).
-
On the decomposition of graphs into complete
bipartite subgraphs
Studies in Pure Mathematics Akadémiai Kiadó, Budapest, (1983) 95--101,
(with P. Erdös and J. Spencer).
-
On complete bipartite subgraphs contained in
spanning tree complements,
Studies in Pure Mathematics, (ed.-in-chief P. Erdös) Akadémiai Kiadó, Budapest, (1983)
83--90,
(with B. Bollobas and R. L. Graham).
-
Minimal decompositions of hypergraphs into mutually
isomorphic subhypergraphs,
J. Comb. Th. (A) 32 (1982), 241--251,
(with P. Erdös and R. L. Graham).
-
A note on subtrees in tournaments,
Bell Laboratories Internal Memorandum, 1982.
-
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).
-
Minimal decomposition of graphs into mutually
isomorphic subgraphs,
Combinatorica 1 (1981), 13--24,
(with P. Erdös and R. L. Graham).
1975-1980
Back to top
1973-1975
Back to top
|