Separating path systems of almost linear size
From MaRDI portal
Publication:6571612
DOI10.1090/TRAN/9187zbMATH Open1543.05096MaRDI QIDQ6571612
Publication date: 12 July 2024
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Expander graphs (05C48)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the path separation number of graphs
- Identifying path covers in graphs
- Separating path systems
- On separating systems whose elements are sets of at most k elements
- Separating systems and oriented graphs of diameter two
- On separating systems
- On separating systems of graphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Proof of Komlós's conjecture on Hamiltonian subsets
- Gallai's conjecture for disconnected graphs
- Clique immersion in graphs without a fixed bipartite graph
- The probabilistic method
- Topological Cliques in Graphs
- Hall's theorem for hypergraphs
- Topological cliques in graphs II
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Crux and Long Cycles in Graphs
- Identifying Codes in Line Graphs
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- The Representation of a Graph by Set Intersections
- On separating systems of a finite set
- On chromatic number of graphs and set-systems
- Minimal completely separating systems
- Ramsey numbers of cycles versus general graphs
- Minimal completely separating systems of \(k\)-sets
- Disjoint isomorphic balanced clique subdivisions
- Separating path systems for the complete graph
- A solution to Erdős and Hajnal’s odd cycle problem
- How to build a pillar: a proof of Thomassen's conjecture
- Towards the Erdős-Gallai cycle decomposition conjecture
- Immersion of complete digraphs in Eulerian digraphs
This page was built for publication: Separating path systems of almost linear size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571612)
