Cover Image

The Bottleneck Birthday Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tripathy, Chijul B.
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Strong Birthday Problem Revisited
by: Tripathy, Chijul B.
Published: (2025)

The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Improving SAT Solvers on Orthogonal Latin Square Problems
by: Barnoff, Aaron, et al.
Published: (2026)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
by: Cornect, Anders, et al.
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

On Computational Aspects of Ordered Matching Problems
by: Čertík, Michal, et al.
Published: (2025)

The Zarankiewicz Problem for Polygon Visibility Graphs
by: Ackerman, Eyal, et al.
Published: (2025)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

On a Traveling Salesman Problem for Points in the Unit Cube
by: Balogh, József, et al.
Published: (2023)

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
by: Park, Seongbeom
Published: (2025)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)