Cover Image

Well-mixing vertices and almost expanders

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborti, Debsoumya, Kim, Jaehoon, Kim, Jinha, Kim, Minki, Liu, Hong
Format:	Preprint
Published:	2021
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fractional Helly theorem for Cartesian products of convex sets
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Twin-width of random graphs
by: Ahn, Jungho, et al.
Published: (2022)

Colorful fractional Helly theorem via weak saturation
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Twin-width of subdivisions of multigraphs
by: Ahn, Jungho, et al.
Published: (2023)

A characterization of testable hypergraph properties
by: Joos, Felix, et al.
Published: (2017)

An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Random 0/1-polytopes expand rapidly
by: Guo, He, et al.
Published: (2026)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)

Word-Representability of Well-Partitioned Chordal Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
by: Beaudou, Laurent, et al.
Published: (2025)

Sufficient conditions for perfect mixed tilings
by: Hurley, Eoin, et al.
Published: (2022)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
by: Hatzel, Meike, et al.
Published: (2026)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

Packing Topological Minors Half-Integrally
by: Liu, Chun-Hung
Published: (2017)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
by: Liu, Yasong, et al.
Published: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)

Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025)

Sparser Abelian High Dimensional Expanders
by: Dikstein, Yotam, et al.
Published: (2024)

On multiplicities of interpoint distances
by: Clemen, Felix Christian, et al.
Published: (2025)

Product Structure and Tree-Decompositions
by: Liu, Chun-Hung, et al.
Published: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Random Schreier graphs as expanders
by: Caillat-Grenier, Geoffroy
Published: (2023)

Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
by: Firman, Oksana, et al.
Published: (2021)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)

Optimal sets of questions for Twenty Questions
by: Filmus, Yuval, et al.
Published: (2021)

On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)

On Generalizations of Pairwise Compatibility Graphs
by: Calamoneri, Tiziana, et al.
Published: (2021)

Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)