Separating path systems in complete graphs

DOI10.1002/RSA.70006MaRDI QIDQ6971043zbMATH OpenFDO

Authors Cristina G. Fernandes, G. O. Mota, Nicolás Sanhueza-Matamala

Publication date 17 June 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/RSA.70006

zbMATH Keywords

complete graphshypergraphsseparating path systems

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65)

Cites work

• Asymptotic lower bounds for Ramsey functions
• Conflict-free hypergraph matchings
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• Embedding rainbow trees with applications to graph labelling and decomposition
• Hamilton decompositions of regular expanders: applications
• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• On orthogonal double covers of graphs
• On the path separation number of graphs
• Orthogonal double covers of complete graphs by trees
• Self-orthogonal Hamilton path decompositions
• Separating path systems
• Separating path systems for the complete graph
• Separating path systems of almost linear size
• Separating the edges of a graph by a linear number of paths
• The robust component structure of dense regular graphs and applications

Cited in

(2)

• Separating path systems for cubic graphs and for complete bipartite graphs
• Vertex-separating path systems in random graphs

This page was built for publication: Separating path systems in complete graphs

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