(k − 2)-linear connected components in hypergraphs of rank k

We define a q-linear path in a hypergraph H as a sequence (e_1,...,e_L) of edges of H such that |e_i ∩ e_i+1 | ∈ [[1, q]] and e_i ∩ e_j = ∅ if |i − j| > 1. In this paper, we study the connected components associated to these paths when q = k − 2 where k is the rank of H. If k = 3 then q = 1 which...

Full description

Bibliographic Details
Main Authors: Florian Galliot, Sylvain Gravier, Isabelle Sivignon
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2023-11-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/10202/pdf