Looms

Ron Aharoni; Eli Berger; Joseph Briggs; He Guo; Shira Zerbib

doi:10.1016/j.disc.2024.114181

Looms

Ron Aharoni
, Eli Berger
, Joseph Briggs
, He Guo
, Shira Zerbib

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

A pair (A,B) of hypergraphs is called orthogonal if |a∩b|=1 for every pair of edges a∈A,b∈B. An orthogonal pair of hypergraphs is called a loom if each of its two members is the set of minimum covers of the other. Looms appear naturally in the context of a conjecture of Gyárfás and Lehel on the covering number of cross-intersecting hypergraphs. We study their properties and ways of construction, and prove special cases of a conjecture that if true would imply the Gyárfás–Lehel conjecture.

Original language	English
Article number	114181
Journal	Discrete Mathematics
Volume	347
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2024.114181
State	Published - Dec 2024

Bibliographical note

Publisher Copyright:
© 2024 Elsevier B.V.

Keywords

Covering numbers of hypergraphs
Fractional matchings
Intersecting hypergraphs
Matchings in hypergraphs
r-partite hypergraphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2024.114181

Cite this

@article{7d677b7d959a4ca998f89e5971d5879e,

title = "Looms",

abstract = "A pair (A,B) of hypergraphs is called orthogonal if |a∩b|=1 for every pair of edges a∈A,b∈B. An orthogonal pair of hypergraphs is called a loom if each of its two members is the set of minimum covers of the other. Looms appear naturally in the context of a conjecture of Gy{\'a}rf{\'a}s and Lehel on the covering number of cross-intersecting hypergraphs. We study their properties and ways of construction, and prove special cases of a conjecture that if true would imply the Gy{\'a}rf{\'a}s–Lehel conjecture.",

keywords = "Covering numbers of hypergraphs, Fractional matchings, Intersecting hypergraphs, Matchings in hypergraphs, r-partite hypergraphs",

author = "Ron Aharoni and Eli Berger and Joseph Briggs and He Guo and Shira Zerbib",

note = "Publisher Copyright: {\textcopyright} 2024 Elsevier B.V.",

year = "2024",

month = dec,

doi = "10.1016/j.disc.2024.114181",

language = "English",

volume = "347",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - Looms

AU - Aharoni, Ron

AU - Berger, Eli

AU - Briggs, Joseph

AU - Guo, He

AU - Zerbib, Shira

PY - 2024/12

Y1 - 2024/12

N2 - A pair (A,B) of hypergraphs is called orthogonal if |a∩b|=1 for every pair of edges a∈A,b∈B. An orthogonal pair of hypergraphs is called a loom if each of its two members is the set of minimum covers of the other. Looms appear naturally in the context of a conjecture of Gyárfás and Lehel on the covering number of cross-intersecting hypergraphs. We study their properties and ways of construction, and prove special cases of a conjecture that if true would imply the Gyárfás–Lehel conjecture.

AB - A pair (A,B) of hypergraphs is called orthogonal if |a∩b|=1 for every pair of edges a∈A,b∈B. An orthogonal pair of hypergraphs is called a loom if each of its two members is the set of minimum covers of the other. Looms appear naturally in the context of a conjecture of Gyárfás and Lehel on the covering number of cross-intersecting hypergraphs. We study their properties and ways of construction, and prove special cases of a conjecture that if true would imply the Gyárfás–Lehel conjecture.

KW - Covering numbers of hypergraphs

KW - Fractional matchings

KW - Intersecting hypergraphs

KW - Matchings in hypergraphs

KW - r-partite hypergraphs

UR - https://www.scopus.com/pages/publications/85199454567

U2 - 10.1016/j.disc.2024.114181

DO - 10.1016/j.disc.2024.114181

M3 - Article

AN - SCOPUS:85199454567

SN - 0012-365X

VL - 347

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

M1 - 114181

ER -

Looms

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this