We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
The Lagrangian of a hypergraph is a function that in a sense seems to measure how ‘tightly packed’ a subset of the hypergraph one can find. Lagrangians were first used by Motzkin and Straus to obtain a new proof of a classic theorem of Turán, and subsequently found a number of very valuable applications in Extremal Hypergraph Theory; one remarkable result they yield is the disproof of a famous "jumping conjecture" of Erdos, which we reprove entirely; we will also introduce a very recent method based on Razborov's flag algebras to show that, though the jumping conjecture is false in general, hypergraphs "do jump" in some cases
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.