Cover Image

Proving it is impossible; on Erdős problem $\# 278$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Cambie, Stijn
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05-01
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Šoltés' hypergraphs
by: Cambie, Stijn
Published: (2024)

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

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

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

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

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

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

On edge-colouring-games by Erdős, and Bensmail and Mc Inerney
by: Cambie, Stijn, et al.
Published: (2025)

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

Maximum ratio of (graph) irregularities
by: Cambie, Stijn, et al.
Published: (2026)

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

Resolution of an Erdős' problem on least common multiples
by: Cambie, Stijn
Published: (2024)

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

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

Daniel Litt's Probability Puzzle
by: Paterson, Maura B., et al.
Published: (2024)

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

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

Asymmetric list sizes in bipartite graphs
by: Alon, Noga, et al.
Published: (2020)

Cycles in graphs and in hypergraphs: results and problems
by: Alkin, E., et al.
Published: (2023)

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

What is a Parking Function?
by: Mori, J. Carlos Martínez
Published: (2024)

Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024)

Super major index and Thrall's problem
by: Armon, Sam, et al.
Published: (2024)

Sharp Bounds on Lengths of Linear Recolouring Sequences
by: Cambie, Stijn, et al.
Published: (2024)

Thrall's problem for two rows
by: Huh, JiSun, et al.
Published: (2026)

$x(1-t(x+x^{-1}))F(x;t) = x-tF(0;t)$
by: Buchacher, Manfred
Published: (2025)

Tight eigenvalue bound on the traveling salesman problem
by: Wolff, Lasse H.
Published: (2025)

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

Ramsey number of a cycle versus a graph of a given size
by: Cambie, Stijn, et al.
Published: (2026)

A precise condition for independent transversals in bipartite covers
by: Cambie, Stijn, et al.
Published: (2023)

On an early paper of Maryam Mirzakhani
by: Martin, William J.
Published: (2017)

Convex Geometries yielded by Transit Functions
by: Changat, Manoj, et al.
Published: (2024)

On the critical group of the k-partite graph
by: Dong, Xinyu, et al.
Published: (2024)

On Erdős problem $\# 648$
by: Cambie, Stijn
Published: (2025)

Generalized Erdős-Rogers problems for hypergraphs
by: He, Xiaoyu, et al.
Published: (2025)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

Dominic Welsh (1938-2023)
by: Grimmett, Geoffrey R.
Published: (2024)