Cover Image

Hyperstability in the Erdős-Sós Conjecture

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Pokrovskiy, Alexey
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C35, 05C05, 05C75, 68V20 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Notes on embedding trees in graphs with O(|T|)-sized covers
by: Pokrovskiy, Alexey
Published: (2024)

Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic
by: Carr, Avery
Published: (2026)

Closed-Form Analysis and Extremal Bounds of Albertson and Sigma Indices in Trees with Prescribed Degree Sequences
by: Hamoud, Jasem, et al.
Published: (2025)

Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
by: Carr, Avery
Published: (2025)

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
by: Edmonds, Chelsea, et al.
Published: (2023)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

A note on the 2-Factor Hamiltonicity Conjecture
by: Gorsky, Maximilian, et al.
Published: (2024)

Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes
by: Hamoud, Jasem, et al.
Published: (2025)

Extremal Degree Irregularity Bounds for Albertson and Sigma Indices in Trees and Bipartite Graphs
by: Hamoud, Jasem, et al.
Published: (2025)

Extremal Bounds on the Sigma and Albertson Indices for Non-Decreasing Degree Sequences
by: Hamoud, Jasem, et al.
Published: (2025)

The Exponential Hyper-Zagreb Indices and Structural Properties of Trees and Bipartite Graphs
by: Hamoud, Jasem
Published: (2025)

Regularities of Typical Sigma Index on Caterpillar Trees of Pendent Vertices
by: Hamoud, Jasem, et al.
Published: (2025)

Optimal Behaviour in Extremal Bounds for $σ$-Irregularity
by: Hamoud, Jasem, et al.
Published: (2025)

On Mixed Cages
by: Exoo, Geoffrey
Published: (2022)

Topological Indices Among Strong Support Vertex
by: Hamoud, Jasem, et al.
Published: (2025)

On Topological Indices in Trees: Fibonacci Degree Sequences and Bounds
by: Hamoud, Jasem, et al.
Published: (2025)

Degree Sequence of Albertson and $σ$-Indices on Trees of Order $n\geqslant 3$
by: Hamoud, Jasem, et al.
Published: (2025)

Bounds on Trees with Topological Indices Among Degree Sequence
by: Hamoud, Jasem, et al.
Published: (2025)

Excluding surfaces as minors in graphs
by: Thilikos, Dimitrios M., et al.
Published: (2026)

Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Rainbow Erdős-Sós Conjectures
by: Crawford, Nicholas, et al.
Published: (2025)

The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)

Prime vertex-minors of a prime graph
by: Kim, Donggyu, et al.
Published: (2022)

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

Vertex identification to a forest
by: Morelle, Laure, et al.
Published: (2024)

Faster parameterized algorithms for modification problems to minor-closed classes
by: Morelle, Laure, et al.
Published: (2022)

Theta-Relations Among Degree-Based Tree Indices
by: Abdullah, Duaa, et al.
Published: (2026)

Slavic Techniques for Hat Guessing Algorithms
by: McInnis, I. M. J.
Published: (2025)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

The partial gossip problem revisited
by: Kokhas, Konstantin, et al.
Published: (2026)

Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
by: Buslov, Vasily
Published: (2025)

When a forest, narrowed to an atom of subset algebra, turns out to be a tree
by: Buslov, Vasily
Published: (2025)

Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
by: Buslov, Vasily
Published: (2025)