The number of possibilities for random dating
Fuente:
arXiv
Guardado en:
| Autores principales: | Abrams, Aaron, Canfield, Rod, Granville, Andrew |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Invitation to the subpath number
por: Knor, Martin, et al.
Publicado: (2025)
por: Knor, Martin, et al.
Publicado: (2025)
The subpath number of cactus graphs
por: Knor, Martin, et al.
Publicado: (2025)
por: Knor, Martin, et al.
Publicado: (2025)
Generalized Turán problem with bounded matching number
por: Ma, Yue, et al.
Publicado: (2023)
por: Ma, Yue, et al.
Publicado: (2023)
On the number of connected edge cover sets in a graph
por: Zare, Mahsa, et al.
Publicado: (2024)
por: Zare, Mahsa, et al.
Publicado: (2024)
On the minimum number of maximal distance-$k$ independent sets in trees
por: Taletskii, Dmitrii
Publicado: (2026)
por: Taletskii, Dmitrii
Publicado: (2026)
Subgraphs in random graphs with specified degrees and forbidden edges
por: Larkin, John, et al.
Publicado: (2025)
por: Larkin, John, et al.
Publicado: (2025)
Upper bound for the number of maximal dissociation sets in trees
por: Wang, Ziyuan, et al.
Publicado: (2024)
por: Wang, Ziyuan, et al.
Publicado: (2024)
On the number of small edge-weighted subgraphs
por: Yu, Feng, et al.
Publicado: (2025)
por: Yu, Feng, et al.
Publicado: (2025)
Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
por: Andriantiana, Eric O. D., et al.
Publicado: (2026)
por: Andriantiana, Eric O. D., et al.
Publicado: (2026)
Automated Counting of Spanning Trees for Several Infinite Families of Graphs
por: Blanco, Pablo, et al.
Publicado: (2025)
por: Blanco, Pablo, et al.
Publicado: (2025)
Upper Chromatic Numbers: An Update
por: Abrams, Aaron
Publicado: (2025)
por: Abrams, Aaron
Publicado: (2025)
The $k^{\text th}$ Upper Chromatic Number of the Line
por: Abrams, Aaron
Publicado: (2025)
por: Abrams, Aaron
Publicado: (2025)
Asymptotics for the number of bipartite graphs with fixed surplus
por: Clancy Jr, David
Publicado: (2024)
por: Clancy Jr, David
Publicado: (2024)
Maximal independent sets in graphs with given matching number
por: Shi, Yongtang, et al.
Publicado: (2024)
por: Shi, Yongtang, et al.
Publicado: (2024)
Counterexamples to two conjectures on mean color numbers of graphs
por: Zhai, Wushuang, et al.
Publicado: (2024)
por: Zhai, Wushuang, et al.
Publicado: (2024)
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025)
por: Xu, Shaohan, et al.
Publicado: (2025)
Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations
por: Bishop, Jamie, et al.
Publicado: (2022)
por: Bishop, Jamie, et al.
Publicado: (2022)
Extremal graphs with minimum number of connected subgraphs in a given family
por: Pandey, Dinesh, et al.
Publicado: (2025)
por: Pandey, Dinesh, et al.
Publicado: (2025)
The minimum number of detours in a connected graph of minimum degree three
por: Liu, Xining, et al.
Publicado: (2026)
por: Liu, Xining, et al.
Publicado: (2026)
The maximum number of paths of a given length in a nonhamiltonian graph
por: Li, Chengli, et al.
Publicado: (2026)
por: Li, Chengli, et al.
Publicado: (2026)
An algebraic approach to asymptotics of the number of unlabelled bicolored graphs
por: Salch, A.
Publicado: (2024)
por: Salch, A.
Publicado: (2024)
Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs
por: Miezaki, Tsuyoshi, et al.
Publicado: (2025)
por: Miezaki, Tsuyoshi, et al.
Publicado: (2025)
Bivariate asymptotics via random walks: application to large genus maps
por: Price, Andrew Elvey, et al.
Publicado: (2025)
por: Price, Andrew Elvey, et al.
Publicado: (2025)
Refined Horton-Strahler numbers I: a discrete bijection
por: Addario-Berry, Louigi, et al.
Publicado: (2024)
por: Addario-Berry, Louigi, et al.
Publicado: (2024)
Towards a classification of $1$-homogeneous distance-regular graphs with positive intersection number $a_1$
por: Koolen, Jack H., et al.
Publicado: (2024)
por: Koolen, Jack H., et al.
Publicado: (2024)
Hurwitz numbers of a fixed partition (m, 1^{n-m}) via enumeration of unrooted hypermaps
por: Song, Yi
Publicado: (2026)
por: Song, Yi
Publicado: (2026)
Yet Another Species of Forbidden-distances Chromatic Number
por: Abrams, Aaron, et al.
Publicado: (2025)
por: Abrams, Aaron, et al.
Publicado: (2025)
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
por: Ge, Jun, et al.
Publicado: (2026)
por: Ge, Jun, et al.
Publicado: (2026)
Encoding and Enumerating Acyclic Orientations of Graphs
por: Carballosa, Walter, et al.
Publicado: (2023)
por: Carballosa, Walter, et al.
Publicado: (2023)
Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
por: Burnette, Charles, et al.
Publicado: (2025)
por: Burnette, Charles, et al.
Publicado: (2025)
The number and structure of connected graphs with a fixed degree sequence
por: Bell, Sasha, et al.
Publicado: (2026)
por: Bell, Sasha, et al.
Publicado: (2026)
Effective MC-finiteness
por: Filmus, Yuval, et al.
Publicado: (2025)
por: Filmus, Yuval, et al.
Publicado: (2025)
On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
por: Halberg, Charlie, et al.
Publicado: (2020)
por: Halberg, Charlie, et al.
Publicado: (2020)
A tail bound for cumulant series for complex functions of independent random variables
por: Isaev, Mikhail
Publicado: (2025)
por: Isaev, Mikhail
Publicado: (2025)
Bicyclic graphs with the smallest and largest numbers of connected sets
por: Dossou-Olory, Audace A. V.
Publicado: (2026)
por: Dossou-Olory, Audace A. V.
Publicado: (2026)
On the number of Hamiltonian cycles in the generalized Petersen graph
por: Haugland, Jan Kristian
Publicado: (2025)
por: Haugland, Jan Kristian
Publicado: (2025)
Triangle-free subsets of the $r$-distance graph of the Hypercube
por: Mukkamala, Padmini, et al.
Publicado: (2025)
por: Mukkamala, Padmini, et al.
Publicado: (2025)
On the enumeration of connected sets in finite cylindrical lattice graphs
por: Ma, Hongxia, et al.
Publicado: (2025)
por: Ma, Hongxia, et al.
Publicado: (2025)
On the Number of Connected Edge Cover Sets of Some Graph Families
por: Abdian, Ali Zeydi, et al.
Publicado: (2026)
por: Abdian, Ali Zeydi, et al.
Publicado: (2026)
Counting paths in directed graphs
por: Hajac, Piotr M., et al.
Publicado: (2022)
por: Hajac, Piotr M., et al.
Publicado: (2022)
Ejemplares similares
-
Invitation to the subpath number
por: Knor, Martin, et al.
Publicado: (2025) -
The subpath number of cactus graphs
por: Knor, Martin, et al.
Publicado: (2025) -
Generalized Turán problem with bounded matching number
por: Ma, Yue, et al.
Publicado: (2023) -
On the number of connected edge cover sets in a graph
por: Zare, Mahsa, et al.
Publicado: (2024) -
On the minimum number of maximal distance-$k$ independent sets in trees
por: Taletskii, Dmitrii
Publicado: (2026)