:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Cambie, Stijn, Kim, Jaehoon, Lee, Hyunwoo, Liu, Hong, Tran, Tuan
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2504.05162
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Šoltés' hypergraphs
por: Cambie, Stijn
Publicado: (2024)

Dense triangle-free $(n, d, λ)$-graphs for all orders
por: Kim, Jaehoon, et al.
Publicado: (2024)

Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
por: Cambie, Stijn, et al.
Publicado: (2025)

Proving it is impossible; on Erdős problem $\# 278$
por: Cambie, Stijn
Publicado: (2025)

On Sidorenko exponents of hypergraphs
por: Lee, Hyunwoo
Publicado: (2025)

Random matchings in linear hypergraphs
por: Lee, Hyunwoo
Publicado: (2024)

Reconstructing hypergraph matching polynomials
por: Kim, Donggyu, et al.
Publicado: (2025)

Better bounds for the union-closed sets conjecture using the entropy approach
por: Cambie, Stijn
Publicado: (2022)

Dirac's theorem for linear hypergraphs
por: Im, Seonghyuk, et al.
Publicado: (2024)

Resolution of Erdős' problems about unimodularity
por: Cambie, Stijn
Publicado: (2025)

Abundancy of $z$-\v Soltés' digraphs
por: Cambie, Stijn
Publicado: (2024)

The average solution of a TSP instance in a graph
por: Cambie, Stijn
Publicado: (2022)

A quantitative improvement on the hypergraph Balog-Szemerédi-Gowers theorem
por: Lee, Hyunwoo
Publicado: (2025)

Descents and inversions in powers of permutations
por: Cambie, Stijn, et al.
Publicado: (2024)

On the extrema of the mean subtree order of graphs
por: Cambie, Stijn, et al.
Publicado: (2025)

Transversal cycles and paths in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)

Hamilton transversals in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)

Relative discrepancy of hypergraphs
por: Luong-Le, Diep, et al.
Publicado: (2025)

Towards the essence of Šoltés' problem
por: Cambie, Stijn
Publicado: (2024)

Benjamini-Schramm convergence and subtrees of trees
por: Cambie, Stijn, et al.
Publicado: (2026)

On a weaker notion of cross $t$-intersecting families
por: Ai, Jiangdong, et al.
Publicado: (2026)

On the order-diameter ratio of girth-diameter cages
por: Cambie, Stijn, et al.
Publicado: (2025)

On a rainbow extremal problem for color-critical graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2022)

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

Sharp results for the Erdős, Pach, Pollack and Tuza problem
por: Cambie, Stijn, et al.
Publicado: (2025)

Note on extremal problems about connected subgraph sums
por: Cambie, Stijn, et al.
Publicado: (2025)

The minimum number of maximal independent sets in twin-free graphs
por: Cambie, Stijn, et al.
Publicado: (2022)

Maximum ratio of (graph) irregularities
por: Cambie, Stijn, et al.
Publicado: (2026)

Hypergraph saturation for the bow tie
por: Cambie, Stijn, et al.
Publicado: (2024)

On a Ramsey--Turán variant of Roth's theorem
por: Bucić, Matija, et al.
Publicado: (2025)

On generating sets of left-compressed intersecting families
por: Nguyen, Tuan, et al.
Publicado: (2025)

Bounding mean orders of sub-$k$-trees of $k$-trees
por: Cambie, Stijn, et al.
Publicado: (2023)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
por: Cambie, Stijn, et al.
Publicado: (2023)

On the main distance-based entropies: the eccentricity- and Wiener-entropy
por: Cambie, Stijn, et al.
Publicado: (2022)

On the largest degrees in intersecting hypergraphs
por: Frankl, Peter, et al.
Publicado: (2025)

On the $C$-diversity of intersecting hypergraphs
por: Frankl, Peter, et al.
Publicado: (2023)

Independent transversals in bipartite correspondence-covers
por: Cambie, Stijn, et al.
Publicado: (2020)

A characterization of testable hypergraph properties
por: Joos, Felix, et al.
Publicado: (2017)

Lexicographical ordering by spectral moments of bicyclic hypergraphs
por: Zhou, Hong, et al.
Publicado: (2025)

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
por: Draganić, Nemanja, et al.
Publicado: (2025)