Julien Portier

From MaRDI portal
(Redirected from Person:2092401)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Double-jump phase transition for the reverse Littlewood-Offord problem
Journal of the London Mathematical Society. Second Series
2026-05-27Paper
Reconstructing almost all of a point set in \(\mathbb{R}^d\) from randomly revealed pairwise distances
SIAM Journal on Discrete Mathematics
2026-04-01Paper
Exponential odd-distance sets under the Manhattan metric
The Electronic Journal of Combinatorics
2025-11-12Paper
Packing paths in sparse random graphs
Random Structures & Algorithms
2025-08-29Paper
Tight anti-concentration of Rademacher sums
Random Structures & Algorithms
2025-08-29Paper
The complexity of decomposing a graph into a matching and a bounded linear forest
Journal of Graph Theory
2025-05-04Paper
A proof of the 3/4-conjecture for the total domination game
SIAM Journal on Discrete Mathematics
2025-01-22Paper
The asymptotic of off-diagonal online Ramsey numbers for paths
European Journal of Combinatorics
2024-09-30Paper
A note on interval colourings of graphs
European Journal of Combinatorics
2024-07-08Paper
On the number of minimum dominating sets and total dominating sets in forests
Journal of Graph Theory
2024-07-02Paper
Bounds for the competition-independence game on trees
Discrete Mathematics
2024-01-17Paper
Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem2023-06-13Paper
The complexity of decomposing a graph into a matching and a bounded linear forest2023-04-06Paper
On interval colourings of graphs2023-03-09Paper
The odd chromatic number of a planar graph is at most 8
Graphs and Combinatorics
2023-03-09Paper
A note on interval colourings of graphs2023-03-08Paper
Progress towards the 1/2-Conjecture for the domination game2023-01-12Paper
A proof of the 3/4 conjecture for the total domination game2022-11-29Paper
A note on cops and robbers, independence number, domination number and diameter
Discrete Mathematics
2022-11-02Paper
A new lower bound on the optimal pebbling number of the grid
Discrete Mathematics
2022-11-02Paper
A faster algorithm for cops and robbers
Discrete Applied Mathematics
2022-08-24Paper
Ternary Egyptian fractions with prime denominator
Research in Number Theory
2022-07-13Paper
On the number of minimum dominating sets and total dominating sets in forests2022-06-27Paper
The odd chromatic number of a planar graph is at most 8
(available as arXiv preprint)
2022-01-28Paper
The asymptotic of off-diagonal online Ramsey numbers for paths
(available as arXiv preprint)
N/APaper
Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Julien Portier