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

DOI10.46298/DMTCS.10202zbMATH Open1547.0521MaRDI QIDQ6599814

Florian Galliot, Sylvain Gravier, Isabelle Sivignon

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

connectivitypathpolynomial-time algorithmchain3-uniform hypergraphlinear pathMaker-Breaker positional game

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Turán numbers for 3-uniform linear paths of length 3
• Ramsey numbers of 3-uniform loose paths and loose cycles
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Some results on chromaticity of quasi-linear paths and cycles
• On the complexity of strongly connected components in directed hypergraphs
• On paths avoding forbidden pairs of vertices in a graph
• The checkpoint problem
• On the complexity of paths avoiding forbidden pairs
• Linear connectivity problems in directed hypergraphs
• Complexity of representation of graphs by set systems
• Intersection graphs of k-uniform linear hypergraphs
• Directed hypergraphs and applications
• Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
• Tractable unordered 3-CNF games
• On line graphs of linear 3-uniform hypergraphs
• Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
• On the Size‐Ramsey Number of Hypergraphs
• Characterizations of derived graphs
• Edge intersection graphs of linear 3-uniform hypergraphs

Related Items (1)

Complexity of maker-breaker games on edge sets of graphs

This page was built for publication: \((k-2)\)-linear connected components in hypergraphs of rank \(k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599814)