Fractional covers of hypergraphs with bounded multi-intersection

Fractional covers of hypergraphs with bounded multi-intersection

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of hypergraphs. Our main technical result generalizes and unifies pre...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Gottlob, G, Lanzinger, MP, Pichler, R, Razgon, I
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	Elsevier 2023

Míreanna comhchosúla

Complexity analysis of generalized and fractional hypertree decompositions
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2021)

A note on intersecting hypergraphs with large cover number
de réir: Haxell, P, et al.
Foilsithe / Cruthaithe: (2017)

Intersections of hypergraphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2014)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2004)

Achieving new upper bounds for the hypergraph duality problem through logic
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2018)

Achieving new upper bounds for the hypergraph duality problem through logic
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2014)

Edge intersection hypergraphs
de réir: Martin Sonntag, et al.
Foilsithe / Cruthaithe: (2024-01-01)

Hypergraph Transversals
de réir: Gottlob, G
Foilsithe / Cruthaithe: (2004)

HyperBench: A benchmark and tool for hypergraphs and empirical findings
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2019)

Intersections of random hypergraphs and tournaments
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2014)

Bounds for the Energy of Hypergraphs
de réir: Liya Jess Kurian, et al.
Foilsithe / Cruthaithe: (2024-11-01)

Hypergraphs of bounded disjointness
de réir: Scott, A, et al.
Foilsithe / Cruthaithe: (2014)

Hypertree width and related hypergraph invariants
de réir: Adler, I, et al.
Foilsithe / Cruthaithe: (2007)

Simplicial homeomorphs and trace-bounded hypergraphs
de réir: Jason Long, et al.
Foilsithe / Cruthaithe: (2022-07-01)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1995)

Hypergraph Transversal Computation and Related Problems in Logic and AI
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

Improved bounds for the graham-pollak problem for hypergraphs
de réir: Leader, Imre, et al.
Foilsithe / Cruthaithe: (2018)

Hypertree-Width and Related Hypergraph Invariants
de réir: Isolde Adler, et al.
Foilsithe / Cruthaithe: (2005-01-01)

New Results on Monotone Dualization and Generating Hypergraph Transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

New results on monotone dualization and generating hypergraph transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2002)

New Results on Monotone Dualization and Generating Hypergraph Transversals
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (2003)

Tractable database design through bounded treewidth
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2006)

Efficient Datalog Abduction through Bounded Treewidth
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
de réir: Chen, H, et al.
Foilsithe / Cruthaithe: (2020)

Fast parallel hypertree decompositions in logarithmic recursion depth
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2022)

Monadic datalog over finite structures of bounded treewidth.
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2010)

Monadic datalog over finite structures with bounded treewidth
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2007)

Covering the Edges of a Random Hypergraph by Cliques
de réir: Rödl Vojtěch, et al.
Foilsithe / Cruthaithe: (2022-11-01)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2010)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2006)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
de réir: Alexandre Bazin, et al.
Foilsithe / Cruthaithe: (2023-04-01)

Hypergraph convolution and hypergraph attention
de réir: Bai, S, et al.
Foilsithe / Cruthaithe: (2020)

Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
de réir: Cheung, Wang Chi, et al.
Foilsithe / Cruthaithe: (2015)

Decomposing hypergraphs into k-colorable hypergraphs
de réir: Gholamreza Omidi, et al.
Foilsithe / Cruthaithe: (2014-06-01)

General and fractional hypertree decompositions: hard and easy cases
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2018)

General and fractional hypertree decompositions: hard and easy cases
de réir: Fischl, W, et al.
Foilsithe / Cruthaithe: (2018)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
de réir: Qiannan Niu, et al.
Foilsithe / Cruthaithe: (2021-01-01)

An analytic approach to sparse hypergraphs: hypergraph removal
de réir: Henry Towsner
Foilsithe / Cruthaithe: (2018-01-01)

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs
de réir: T. V. Lubasheva
Foilsithe / Cruthaithe: (2018-12-01)