2 citations · 6 across the 8 of their papers we have counts for
8 papers
On hypergraph Lagrangians
Qingsong Tang, Xiaojun Lu, Xiangde Zhang +1
It is conjectured by Frankl and Füredi that the -uniform hypergraph with edges formed by taking the first sets in the colex ordering of has the large…
Connection between the clique number and the Lagrangian of -uniform hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
There is a remarkable connection between the clique number and the Lagrangian of a 2-graph proved by Motzkin and Straus in 1965. It is useful in practice if similar results hold fo…
On hypergraph cliques and polynomial programming
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadra…
On Lagrangians of Hypergraphs Containing Dense Subgraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employ…
On the largest graph-Lagrangians of hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Frankl and Füredi (1989) conjectured that the -graph with edges formed by taking the first sets in the colex ordering of has the largest graph-Lagran…
On Lagrangians of r-uniform Hypergraphs
Yuejian Peng, Qingsong Tang, Cheng Zhao
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in [7]. This connection and its extensions were su…
Some Results on Lagrangians of Hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
In 1965, Motzkin and Straus [5] provided a new proof of Turan's theorem based on a continuous characterization of the clique number of a graph using the Lagrangian of a graph. This…
On Frankl and Furedi's conjecture for 3-uniform hypergraphs
Qingsong Tang, Hao Peng, Cailing Wang +1
The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and F…