Image de couverture de livre

Hypertree shrinking avoiding low degree vertices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hylasová, Karolína, Kaiser, Tomáš
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Removal paths avoiding vertices
par: Qi, Yuzhen, et autres
Publié: (2024)

Hypertrees and embedding of the $\mathrm{FMan}$ operad
par: Laubie, Paul
Publié: (2024)

Hypertrees and their host trees: a survey
par: Di Fonzo, Pablo De Caria
Publié: (2025)

Adjacent vertices of small degree in minimal matching covered graphs
par: He, Xiaoling, et autres
Publié: (2026)

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number
par: Li, Chengli, et autres
Publié: (2025)

The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
par: Liu, Xiaoqi, et autres
Publié: (2024)

Ramsey theory of low-degree semialgebraic relations
par: Adibelli, Azem, et autres
Publié: (2026)

Polytopes with low excess degree
par: Pineda-Villavicencio, Guillermo, et autres
Publié: (2024)

Unavoidable subgraphs in digraphs with large out-degrees
par: Hons, Tomáš, et autres
Publié: (2025)

Vertex degrees in grid graphs associated with 213-avoiding permutations
par: Huamaní, N. B.
Publié: (2026)

Pattern avoidance and the fundamental bijection
par: Archer, Kassie, et autres
Publié: (2024)

Permutations that strongly avoid 132
par: Archer, Kassie, et autres
Publié: (2026)

Matchings avoiding ordered patterns
par: Barát, János, et autres
Publié: (2025)

Resilience of Rademacher chaos of low degree
par: Aigner-Horev, Elad, et autres
Publié: (2024)

Color-avoiding connected colorings and orientations
par: Pintér, József, et autres
Publié: (2025)

Color-avoiding directed paths in tournaments
par: Fox, Jacob, et autres
Publié: (2025)

On the importance sampling of self-avoiding walks
par: Bousquet-Mélou, Mireille
Publié: (2011)

Weakly directed self-avoiding walks
par: Bacher, Axel, et autres
Publié: (2010)

Pattern avoidance in revised ascent sequences
par: Zhou, Robin D. P.
Publié: (2025)

Binary operations on pattern-avoiding cycles
par: Archer, Kassie, et autres
Publié: (2025)

Pattern avoidance in compositions and powers of permutations
par: Archer, Kassie, et autres
Publié: (2025)

Inversion sequences avoiding the pattern 010
par: Testart, Benjamin
Publié: (2022)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
par: Asensio, Sara, et autres
Publié: (2024)

A neighborhood union condition for the existence of a spanning tree without samll degree vertices
par: Li, Yibo, et autres
Publié: (2025)

Trees whose even-degree vertices induce a path are antimagic
par: Lozano, Antoni, et autres
Publié: (2019)

List-avoiding orientations
par: Bradshaw, Peter, et autres
Publié: (2022)

On the permutations that strongly avoid the pattern 312 or 231
par: Pan, Junyao, et autres
Publié: (2024)

On the size of sets avoiding a general structure
par: Wang, Runze
Publié: (2024)

Max-tree for d-permutations and pattern avoidance
par: Muller, Thomas
Publié: (2026)

Words avoiding the morphic images of most of their factors
par: Ochem, Pascal, et autres
Publié: (2025)

A note on vertex-critical induced subgraphs of shift graphs
par: Kaiser, Tomáš, et autres
Publié: (2026)

Hypergraph independence bounds: from maximum degree to average degree
par: Yu, Jing, et autres
Publié: (2026)

Extremal oriented graphs avoiding 1-subdivision of an in-star
par: Huang, Zejun, et autres
Publié: (2024)

On a conjecture about pattern avoidance of cycle permutations
par: Pan, Junyao
Publié: (2024)

Disarray, reduced words, and 321-avoidance in George groups
par: Lewis, Joel Brewster, et autres
Publié: (2024)

The enumeration of inversion sequences avoiding the patterns 201 and 210
par: Pantone, Jay
Publié: (2023)

Stoimenow matchings avoiding multiple Catalan patterns simultaneously
par: Lv, Shuzhen, et autres
Publié: (2025)

Simultaneous avoidance of length-4 patterns in ascent sequences
par: Liu, Qi, et autres
Publié: (2026)

A bijection between evil-avoiding and rectangular permutations
par: Tung, Katherine
Publié: (2023)

4-tangrams are 4-avoidable
par: Ochem, Pascal, et autres
Publié: (2025)