Skip to main content
SpringerLink
Log in
Book cover

Recent Advances in Computer Science and Information Engineering pp 7–12Cite as

On Lagrangians of Hypergraphs and Cliques

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 125))

Abstract

Motzkin and Straus establishes a remarkable connection between the maximum clique problem and the Lagrangian of a graph in [4]. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide evidence that the Lagrangian of a 3-uniform hypergraph is related to the size of its maximum cliques under some conditions.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Frankl, P., Rödl, V.: Hypergraphs do not jump. Combinatorica 4, 149–159 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754–768 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. He, G., Peng, Y., Zhao, C.: On finding Lagrangians of 3-uniform hypergraphs, Ars Combinatoria (accepted)

    Google Scholar 

  4. Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17, 533–540 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. Pavan, M., Pelillo, M.: Generalizing the Motzkin-straus Theorem to Edge-Weighted Graphs, with Applications to Image Segmentation. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol. 2683, pp. 485–500. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Peng, Y., Zhao, C.: On Motzkin-Straus Type Results for 3-uniform Hypergraphs (submitted)

    Google Scholar 

  7. Rota Buló, S., Pelillo, M.: A generalization of the Motzkin-Straus theorem to hypergraphs. Optim. Letters 3(2), 287–295 (2009)

    Article  MATH  Google Scholar 

  8. Rota Buló, S., Torsello, A., Pelillo, M.: A Continuous-Based Approach for Partial Clique Enumeration. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 61–70. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Sós, V., Straus, E.G.: Extremal of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory Series B 63, 189–207 (1982)

    Google Scholar 

  10. Talbot, J.: Lagrangians of hypergraphs. Combinatorics, Probability & Computing 11, 199–216 (2002)

    MathSciNet  MATH  Google Scholar 

  11. Turán, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941) (in Hungarian)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indiana State University, Terre Haute, IN, 47809, USA

    Yuejian Peng & Cheng Zhao

  2. Hunan University, Changsha, China

    Yuejian Peng & Cheng Zhao

Authors
  1. Yuejian Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuejian Peng .

Editor information

Editors and Affiliations

  1. , College of Communication Engineering, Jilin University, Room 313, Building No.1, Changchun, Nanhu Avenue 5372, Jilin, 130012, China, People's Republic

    Zhihong Qian

  2. , Department of Electrical Engineering, The University of Mississippi, Anderson Hall 314, Mississippi, 38677, Mississippi, USA

    Lei Cao

  3. , Department of Electrical and Computer En, Naval Postgraduate School, Rm. 452 Spanagel Bldg. 232, Dyer Road 833, Monterey, 93943-5121, California, USA

    Weilian Su

  4. , Faculty of Computing, London Metropolitan University, Holloway Road 166-220, London, N7 8DB, United Kingdom

    Tingkai Wang

  5. , College of Software, Changchun University of Science and Tech, Changchun, Jilin, 130022, China, People's Republic

    Huamin Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Peng, Y., Zhao, C. (2012). On Lagrangians of Hypergraphs and Cliques. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25789-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25789-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25788-9

  • Online ISBN: 978-3-642-25789-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation