Cover Image

Slavic Techniques for Hat Guessing Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	McInnis, I. M. J.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C99 (Primary) 05C35, 68W05 (Secondary) G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

On the distance signless Laplacian spectral radius, fractional matching and factors of graphs
by: Zhang, Z. H., et al.
Published: (2025)

How Trees on Atoms of Subset Algebras Define Minimal Forests and Their Growth
by: Buslov, Vasily
Published: (2025)

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
by: Buslov, V. A.
Published: (2025)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
by: Liang, Kai
Published: (2025)

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

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

On problems in extremal multigraph theory
by: Falgas-Ravry, Victor, et al.
Published: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Hypertrees and their host trees: a survey
by: Di Fonzo, Pablo De Caria
Published: (2025)

Zero-free regions of partition functions with applications to algorithms and graph limits
by: Regts, Guus
Published: (2015)

The family of all local maximum independent sets is an augmentoid
by: Levit, Vadim E., et al.
Published: (2026)

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)

Hyperstability in the Erdős-Sós Conjecture
by: Pokrovskiy, Alexey
Published: (2024)

A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

On 1-Konig-Egervary Graphs
by: Levit, Vadim E., et al.
Published: (2023)

A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

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

Online coloring of short interval graphs and two-count interval graphs
by: Curbelo, Israel R.
Published: (2024)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

W-state graphs: Structure and Algorithms
by: Gajjala, Rishikesh, et al.
Published: (2026)

Polynomial Reconstruction Problem for Hypergraphs
by: Cooper, Joshua, et al.
Published: (2023)

Merge Trees of Periodic Filtrations
by: Edelsbrunner, Herbert, et al.
Published: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Graphs with Large Girth and Small Cop Number
by: Clow, Alexander
Published: (2023)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
by: Diamond, Harvey, et al.
Published: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
by: Diamond, Harvey, et al.
Published: (2024)

The maximal running time of hypergraph bootstrap percolation
by: Hartarsky, Ivailo, et al.
Published: (2022)