IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i3d10.1007_s10878-013-9704-y.html
   My bibliography  Save this article

Large hypertree width for sparse random hypergraphs

Author

Listed:
  • Tian Liu

    (Peking University)

  • Chaoyi Wang

    (Peking University)

  • Ke Xu

    (Beihang University)

Abstract

Hypertree width is a graph-theoretic parameter similar to treewidth. It has many equivalent characterizations and many applications. If the hypertree width of the constraint graphs of the instances of a constraint satisfaction problem is bounded by a constant, then the CSP is tractable In this paper, we show that with high probability, hypertree width is large on sparse random $$k$$ k -uniform hypergraphs. Our results provide further theoretical evidence on the hardness of some random constraint satisfaction problems, called Model RB and Model RD, around the satisfiability phase transition points.

Suggested Citation

  • Tian Liu & Chaoyi Wang & Ke Xu, 2015. "Large hypertree width for sparse random hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 531-540, April.
    • Handle: RePEc:spr:jcomop:v:29:y:2015:i:3:d:10.1007_s10878-013-9704-y
    DOI: 10.1007/s10878-013-9704-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9704-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9704-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hung-Lin Fu & Kuo-Ching Huang & Chin-Lin Shiue, 2013. "A note on optimal pebbling of hypercubes," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 597-601, May.
    2. Chun-Hung Liu & Gerard J. Chang, 2013. "Roman domination on strongly chordal graphs," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 608-619, October.
    3. Shenglong Hu & Liqun Qi, 2012. "Algebraic connectivity of an even uniform hypergraph," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 564-579, November.
    4. B. S. Panda & D. Pradhan, 2013. "Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 770-785, November.
    5. Julie Haviland, 2013. "Independent dominating sets in regular graphs," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 120-126, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J. Amjadi & S. M. Sheikholeslami & M. Soroudi, 2018. "Nordhaus–Gaddum bounds for total Roman domination," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 126-133, January.
    2. Abel Cabrera Martínez & Suitberto Cabrera García & Andrés Carrión García & Frank A. Hernández Mira, 2020. "Total Roman Domination Number of Rooted Product Graphs," Mathematics, MDPI, vol. 8(10), pages 1-13, October.
    3. Shenglong Hu & Guoyin Li & Liqun Qi, 2016. "A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 446-474, February.
    4. Cai-Xia Wang & Yu Yang & Hong-Juan Wang & Shou-Jun Xu, 2021. "Roman {k}-domination in trees and complexity results for some classes of graphs," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 174-186, July.
    5. Abolfazl Poureidi & Nader Jafari Rad, 2020. "Algorithmic and complexity aspects of problems related to total Roman domination for graphs," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 747-763, April.
    6. Abel Cabrera Martínez & Juan C. Hernández-Gómez & José M. Sigarreta, 2021. "On the Quasi-Total Roman Domination Number of Graphs," Mathematics, MDPI, vol. 9(21), pages 1-11, November.
    7. Yisheng Song & Liqun Qi, 2015. "Properties of Some Classes of Structured Tensors," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 854-873, June.
    8. Abel Cabrera Martínez & Dorota Kuziak & Iztok Peterin & Ismael G. Yero, 2020. "Dominating the Direct Product of Two Graphs through Total Roman Strategies," Mathematics, MDPI, vol. 8(9), pages 1-13, August.
    9. Qin Ni & Liqun Qi, 2015. "A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map," Journal of Global Optimization, Springer, vol. 61(4), pages 627-641, April.
    10. Ching-Chi Lin & Cheng-Yu Hsieh & Ta-Yu Mu, 2022. "A linear-time algorithm for weighted paired-domination on block graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 269-286, August.
    11. Meilan Zeng, 2021. "Tensor Z-eigenvalue complementarity problems," Computational Optimization and Applications, Springer, vol. 78(2), pages 559-573, March.
    12. Yuning Yang & Qingzhi Yang & Liqun Qi, 2014. "Properties and methods for finding the best rank-one approximation to higher-order tensors," Computational Optimization and Applications, Springer, vol. 58(1), pages 105-132, May.
    13. Abel Cabrera Martínez & Suitberto Cabrera García & Andrés Carrión García, 2020. "Further Results on the Total Roman Domination in Graphs," Mathematics, MDPI, vol. 8(3), pages 1-8, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:29:y:2015:i:3:d:10.1007_s10878-013-9704-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.