:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Jain, Vishesh, Michelen, Marcus, Wei, Fan
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2306.13014
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The geometry of the giant component of random geometric graphs
by: Dubin, Karoline, et al.
Published: (2026)

The largest $K_r$-free set of vertices in a random graph
by: Bohman, Tom, et al.
Published: (2026)

The random graph process is globally synchronizing
by: Jain, Vishesh, et al.
Published: (2025)

Comparability of random permutations in the strong Bruhat order
by: Christo, Nicholas, et al.
Published: (2026)

The random stable roommates problem typically has no solution
by: Chin, Byron, et al.
Published: (2026)

Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
by: Christo, Nicholas, et al.
Published: (2024)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

Entangled states are typically incomparable
by: Jain, Vishesh, et al.
Published: (2024)

Equality in Fill's spectral gap problem
by: Jain, Vishesh, et al.
Published: (2026)

Rapid mixing of the down-up walk on matchings of a fixed size
by: Jain, Vishesh, et al.
Published: (2024)

On random locally flat-foldable origami
by: Hull, Thomas C., et al.
Published: (2025)

A new lower bound for the Ramsey numbers $R(3,k)$
by: Campos, Marcelo, et al.
Published: (2025)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

The edge-statistics conjecture for hypergraphs
by: Jain, Vishesh, et al.
Published: (2025)

A binomial random multigraph
by: Pelekis, Christos
Published: (2023)

An explicit economical additive basis
by: Jain, Vishesh, et al.
Published: (2024)

Thinned Quantile Shares are Universally Feasible
by: Jain, Vishesh, et al.
Published: (2026)

A polynomial improvement for the odd cycle-complete Ramsey numbers
by: Campos, Marcelo, et al.
Published: (2025)

Maximum induced trees and forests of bounded degree in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2024)

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

A local limit theorem for the edge counts of random induced subgraphs of a random graph
by: Balister, Paul, et al.
Published: (2025)

Towards the classification of scattered binomials
by: Bartoli, Daniele, et al.
Published: (2025)

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph
by: Fang, Ziyi, et al.
Published: (2024)

On binomial edge ideals of corona of graphs
by: Hajra, Buddhadev, et al.
Published: (2025)

Concentration of the maximum size of an induced subtree in moderately sparse random graphs
by: Oropeza, Juan Carlos Buitrago
Published: (2025)

Large cliques in graphs with forbidden semi-induced structures
by: Chen, Nannan, et al.
Published: (2025)

Clique factors in random samplings of regular graphs
by: Sun, Wanting, et al.
Published: (2025)

Even-degeneracy of a random graph
by: Chao, Ting-Wei, et al.
Published: (2025)

Reciprocal binomial sums via Beta integrals
by: Pain, Jean-Christophe
Published: (2026)

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)

Castelnuovo-Mumford regularity of generalized binomial edge ideals of graphs
by: Kiani, Dariush, et al.
Published: (2026)

Generating graphs randomly
by: Greenhill, Catherine
Published: (2022)

The intersection of a random geometric graph with an Erdős-Rényi graph
by: Bennett, Patrick, et al.
Published: (2024)

A refinement of the binomial distribution using the quantum binomial theorem
by: Sills, Andrew V.
Published: (2020)

On an upper bound for central binomial coefficients and Catalan numbers
by: Pain, Jean-Christophe
Published: (2024)

The random graph process is globally synchronizing
by: Vishesh Jain, et al.
Published: (2025)

The number of solutions of a random system of polynomials over a finite field
by: Jain, Ritik
Published: (2024)

Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024)

Characterizing circle graphs with binomial partial Petrial polynomials
by: Feng, Ruiqing, et al.
Published: (2025)

Hamiltonicity of inhomogeneous random graphs
by: Garbe, Frederik, et al.
Published: (2026)