Separating path systems of almost linear size
From MaRDI portal
Recommendations
Cites work
- A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- Clique immersion in graphs without a fixed bipartite graph
- Crux and Long Cycles in Graphs
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Disjoint isomorphic balanced clique subdivisions
- Extremal density for sparse minors and subdivisions
- Gallai's conjecture for disconnected graphs
- Hall's theorem for hypergraphs
- How to build a pillar: a proof of Thomassen's conjecture
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 874214 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- scientific article; zbMATH DE number 3261634 (Why is no real title available?)
- Identifying codes in line graphs
- Identifying path covers in graphs
- Immersion of complete digraphs in Eulerian digraphs
- Minimal completely separating systems
- Minimal completely separating systems of \(k\)-sets
- Nested cycles with no geometric crossings
- On chromatic number of graphs and set-systems
- On separating systems
- On separating systems of a finite set
- On separating systems of graphs
- On separating systems whose elements are sets of at most k elements
- On the path separation number of graphs
- Ramsey numbers of cycles versus general graphs
- Separating path systems
- Separating path systems for the complete graph
- Separating systems and oriented graphs of diameter two
- The probabilistic method
- The Representation of a Graph by Set Intersections
- Topological Cliques in Graphs
- Topological cliques in graphs II
- Towards the Erdős-Gallai cycle decomposition conjecture
Cited in
(9)- Separating path systems for the complete graph
- Nearly Hamilton cycles in sublinear expanders and applications
- Separating path systems in trees
- Separating the edges of a graph by cycles and by subdivisions of K₄
- Cooperation in combinatorial search
- Separating path systems in complete graphs
- Essentially tight bounds for rainbow cycles in proper edge-colourings
- 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 of almost linear size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571612)
