Moments of graphs in monotone families

Journal of Graph Theory

Volumn 51, Issue 1, 2006, Pages 37-48

  Füredi, Zoltán ^a,b   Kündgen, André ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Degree sequence; Moments; Monotone graph family; Optimization

Indexed keywords

ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; BOUNDARY ELEMENT METHOD; BOUNDARY VALUE PROBLEMS; METHOD OF MOMENTS; OPTIMIZATION;

DEGREE SEQUENCE; MOMENTS; MONOTONE GRAPH FAMILIES; SHARP BOUNDS;

GRAPH THEORY;

EID: 33645320524     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20119     Document Type: Article

References (16)

1. R. Aharoni, A problem in rearrangements of (0, 1) matrices, Discrete Math 30 (1980), 191-201.
2. R. Ahlswede and G. O. H. Katona, Graphs with maximal number of adjacent pairs of edges, Acta Mathematica Academiae Scientiarium Hungaricae 32 (1978), 97-120.
3. C. Bey, An upper bound on the sum of squares of degrees in a hypergraph, Discrete Math 269 (2003), 259-263.
4. B. Bollobás and V. Nikiforov, Degree powers in graphs with forbidden subgraphs, Electron J Combin 11(1) (2004), R42, 8 p.
5. O. D. Byer, Two path extremal graphs and an application to a Ramsey-type problem, Discrete Math 196 (1999), 51-64.
6. D. de Caen, An upper bound on the sum of squares of degrees in a graph, Discrete Math 185 (1998), 245-248.
7. Y. Caro and R. Yuster, Degree powers in graphs with forbidden subgraphs, Electron J Combin 7 (2000), R47, 14 p.
8. K. C. Das, Maximizing the sum of the squares of the degrees of a graph. Discrete Math 285(1-3) (2004), 57-66.
9. P. Erd″os, On the graph theorem of Turán, Matematikai Lapok 21 (1970), 249-251 (In Hungarian, MR46# 7090).
10. J. Li and Y. Pan, de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph, Linear Algebra Appl 328 (2001), 153-160.
11. I. Niven, H. S. Zuckerman, and H. L. Montgomery, An Introduction to the Theory of Numbers, Fifth edition, John Wiley & Sons, Inc., New York, 1991.
12. D. Olpp, A conjecture of Goodman and the multiplicities of graphs, Austral J Combin 14 (1996), 267-282.
13. U. Peled, R. Petreschi, and A. Sterbini, (n, e)-graphs with maximum sum of squares of degrees, J Graph Theory 31 (1999), 283-295.
14. J. Pach, F. Shahroki, and M. Szegedy, Applications of the crossing number, Algorithmica 16 (1996), 111-117.
15. J. Pach, J. Spencer, and G. Tóth, New bounds on crossing numbers, Discrete Comput Geom 24 (2000), 623-644.
16. L. A. Székely, L. H. Clark, and R. C. Entringer, An inequality for degree sequences, Discrete Math 103 (1992), 293-300.