:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Young, Andrew J.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2407.19137
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A note on the random greedy independent set algorithm
by: Bennett, Patrick, et al.
Published: (2013)

Surprising identities for the greedy independent set on Cayley trees
by: Contat, Alice
Published: (2021)

On maximizing the number of heads when you need to set aside at least one coin every round
by: van Doorn, Wouter
Published: (2024)

The third positive element in the greedy $B_h$-set
by: Nathanson, Melvyn B.
Published: (2023)

The fourth positive element in the greedy $B_h$-set
by: Nathanson, Melvyn B., et al.
Published: (2023)

On eventually greedy best underapproximations by Egyptian fractions
by: Kovač, Vjekoslav
Published: (2024)

The change-making problem for six coin values and beyond
by: Van Cott, Cornelia A., et al.
Published: (2023)

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

Intervals in the greedy Tamari posets
by: Bousquet-Mélou, Mireille, et al.
Published: (2023)

Large deviations of the greedy independent set algorithm on sparse random graphs
by: Kolesnik, Brett
Published: (2020)

Moments for generalizations of a coin flip game
by: Huang, Jia
Published: (2026)

A coin flip game and generalizations of Fibonacci numbers
by: Huang, Jia
Published: (2025)

A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
by: Segert, Simon
Published: (2024)

On higher dimensional point sets in general position
by: Suk, Andrew, et al.
Published: (2022)

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)

How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?
by: Ekhad, Shalosh B., et al.
Published: (2024)

On the set partitions that require maximum sorts through the $aba-$avoiding stack
by: Choi, Yunseo, et al.
Published: (2024)

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
by: Janson, Svante, et al.
Published: (2025)

There are infinitely many Hilbert cubes of dimension 3 in the set of squares
by: Bremner, Andrew, et al.
Published: (2026)

The sum-product problem for small sets
by: Clevenger, Ginny Ray, et al.
Published: (2023)

Separations of sets
by: Bowler, Nathan, et al.
Published: (2018)

General position sets, colinear sets, and Sierpiński product graphs
by: Klavžar, Sandi, et al.
Published: (2024)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

A note on strong blocking sets and higgledy-piggledy sets of lines
by: Lia, Stefano, et al.
Published: (2024)

Sumsets of random sets
by: Nenadov, Rajko, et al.
Published: (2026)

Profinite tree sets
by: Kneip, Jay Lilian
Published: (2019)

Towards a Complete Local-Global Principle
by: Kuzmanovski, Nikola
Published: (2024)

An EKR Theorem for the Cartesian Product of Complete Graphs
by: Joseph, Zaphenath
Published: (2025)

Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)

New Method for Constructing Complete Cap Sets
by: Karapetyana, Iskandar, et al.
Published: (2026)

Associated Permutations of Complete Non-Ambiguous Trees
by: Chen, Daniel, et al.
Published: (2022)

Zero forcing irredundant sets
by: Curtis, Bryan A., et al.
Published: (2024)

Nowhere dense Ramsey sets
by: Rödl, Vojtěch, et al.
Published: (2024)

On skew corner-free sets
by: Pohoata, Cosmin, et al.
Published: (2024)

Exact results on traces of sets
by: Li, Mingze, et al.
Published: (2024)

Minors in small-set expanders
by: Krivelevich, Michael, et al.
Published: (2025)

Regular fat linear sets
by: Smaldore, Valentino, et al.
Published: (2025)

Global coalition sets in graphs
by: Besharati, Nazli, et al.
Published: (2025)

Alternative Proof of the Determinant of Complete Non-Ambiguous Trees
by: Chen, Daniel
Published: (2024)