Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Yuejian Peng

doi:10.1016/j.disc.2006.09.024

Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Discrete Mathematics ◽

10.1016/j.disc.2006.09.024 ◽

2007 ◽

Vol 307 (14) ◽

pp. 1754-1766 ◽

Cited By ~ 9

Author(s):

Yuejian Peng

Keyword(s):

Lagrangians Of Hypergraphs

Download Full-text

Some optimization problems related to Lagrangians of hypergraphs

2009 IEEE International Symposium on IT in Medicine & Education ◽

10.1109/itime.2009.5236468 ◽

2009 ◽

Author(s):

Yue-jian Peng ◽

Xiangde Zhang ◽

Cheng Zhao

Keyword(s):

Optimization Problems ◽

Lagrangians Of Hypergraphs

Download Full-text

Using Lagrangians of Hypergraphs to Find Non-Jumping Numbers (I)

Annals of Combinatorics ◽

10.1007/s00026-008-0353-2 ◽

2008 ◽

Vol 12 (3) ◽

pp. 307-324 ◽

Cited By ~ 9

Author(s):

Yuejian Peng

Keyword(s):

Lagrangians Of Hypergraphs

Download Full-text

Lagrangians of Hypergraphs

Combinatorics Probability Computing ◽

10.1017/s0963548301005053 ◽

2002 ◽

Vol 11 (2) ◽

pp. 199-216 ◽

Cited By ~ 35

Author(s):

J. M. TALBOT

Keyword(s):

Interesting Case ◽

Lagrangians Of Hypergraphs ◽

Colex Ordering

How large can the Lagrangian of an r-graph with m edges be? Frankl and Füredi [1] conjectured that the r-graph of size m formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs of size m. We prove the first ‘interesting’ case of this conjecture, namely that the 3-graph with (t3) edges and largest Lagrangian is [t](3). We also prove that this conjecture is true for 3-graphs of several other sizes.For general r-graphs we prove a weaker result: for t sufficiently large, the r-graph of size (tr) supported on t + 1 vertices and with largest Lagrangian, is [t](r).

Download Full-text