Separating path systems of almost linear size
type: Item
instance of: scholarly article
title: Separating path systems of almost linear size
zbMATH Open document ID: 1543.05096
author: Shoham Letzter
published in: Transactions of the American Mathematical Society
publication date: 2024-07-12T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C48
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7880408
zbMATH Keywords: smallest separating system
zbMATH Keywords: Gallai's conjecture
MaRDI profile type: Publication
cites work: Hall's theorem for hypergraphs
cites work: The probabilistic method
cites work: On the path separation number of graphs
cites work: On separating systems
cites work: Separating systems and oriented graphs of diameter two
cites work: Towards the Erdős-Gallai cycle decomposition conjecture
cites work: On separating systems of graphs
cites work: Gallai's conjecture for disconnected graphs
cites work: The Representation of a Graph by Set Intersections
cites work: On chromatic number of graphs and set-systems
cites work: Separating path systems
cites work: Disjoint isomorphic balanced clique subdivisions
cites work: Nested cycles with no geometric crossings
cites work: How to build a pillar: a proof of Thomassen's conjecture
cites work: Identifying Codes in Line Graphs
cites work: Identifying path covers in graphs
cites work: Q5547602
cites work: Crux and Long Cycles in Graphs
cites work: Ramsey numbers of cycles versus general graphs
cites work: Extremal density for sparse minors and subdivisions
cites work: Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
cites work: On separating systems of a finite set
cites work: Proof of Komlós's conjecture on Hamiltonian subsets
cites work: Topological Cliques in Graphs
cites work: Topological cliques in graphs II
cites work: Minimal completely separating systems of \(k\)-sets
cites work: Immersion of complete digraphs in Eulerian digraphs
cites work: A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
cites work: A solution to Erdős and Hajnal’s odd cycle problem
cites work: Clique immersion in graphs without a fixed bipartite graph
cites work: Q5539649
cites work: Q4876748
cites work: Q3279628
cites work: Minimal completely separating systems
cites work: On separating systems whose elements are sets of at most k elements
cites work: Separating path systems for the complete graph
DOI: 10.1090/TRAN/9187
description: scientific article; zbMATH DE number 7880408