I agree that this site is using cookies. You can find further informations here.
X
Knierim, Charlotte
32  results:
Search for persons X
?
1

Schur properties of randomly perturbed sets:

Das, Shagnik ; Knierim, Charlotte ; Morris, Patrick
European Journal of Combinatorics.  121 (2024)  - p. 103843 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Reconstructibility of the K-count from n − 1 cards:

Knierim, Charlotte ; Martinsson, Anders
Discrete Mathematics.  347 (2024)  6 - p. 113950 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Hat Guessing Numbers of Strongly Degenerate Graphs:

Knierim, Charlotte ; Martinsson, Anders ; Steiner, Raphael
SIAM Journal on Discrete Mathematics.  37 (2023)  2 - p. 1331-1347 , 2023
Link: https://doi.org/10.1137/..
 
?
4

Long cycles, heavy cycles and cycle decompositions in digra..:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders.
Journal of Combinatorial Theory, Series B.  148 (2021)  - p. 125-148 , 2021
Link: https://doi.org/10.1016/..
 
?
5

K-factors in graphs with low independence number:

Knierim, Charlotte ; Su, Pascal
Journal of Combinatorial Theory, Series B.  148 (2021)  - p. 60-83 , 2021
Link: https://doi.org/10.1016/..
 
?
6

Schur's Theorem for Randomly Perturbed Sets:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Das, Shagnik ; Knierim, Charlotte ; Morris, Patrick - p. 384-389 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Schur properties of randomly perturbed sets:

Das, Shagnik ; Knierim, Charlotte ; Morris, Patrick
http://arxiv.org/abs/2205.01456.  , 2022
Link: http://arxiv.org/abs/220..
 
?
8

On Partition Problems in Combinatorics:

Knierim, Charlotte
http://hdl.handle.net/20.500.11850/595083.  , 2022
Link: https://hdl.handle.net/2..
 
?
9

Note on Long Paths in Eulerian Digraphs:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v28i2p37/pdf.  , 2021
Link: https://www.combinatoric..
 
?
10

Note on Long Paths in Eulerian Digraphs:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders
http://arxiv.org/abs/2103.05330.  , 2021
Link: http://arxiv.org/abs/210..
 
?
11

Reconstructibility of the $K_r$-count from $n-1$ cards:

Knierim, Charlotte ; Martinsson, Anders
http://arxiv.org/abs/2112.03366.  , 2021
Link: http://arxiv.org/abs/211..
 
?
12

Hat guessing numbers of strongly degenerate graphs:

Knierim, Charlotte ; Martinsson, Anders ; Steiner, Raphael
http://arxiv.org/abs/2112.09619.  , 2021
Link: http://arxiv.org/abs/211..
 
?
13

Improved bounds on the multicolor Ramsey numbers of paths a..:

Knierim, Charlotte ; Su, Pascal
info:eu-repo/semantics/altIdentifier/wos/000463558300005.  , 2019
Link: https://hdl.handle.net/2..
 
?
14

The Maximum Label Propagation Algorithm on Sparse Random Gr..:

Knierim, Charlotte ; Lengler, Johannes ; Pfister, Pascal..
doi:10.4230/LIPIcs.APPROX-RANDOM.2019.58.  , 2019
Link: https://doi.org/10.4230/..
 
?
15

$K_r$-Factors in Graphs with Low Independence Number:

Knierim, Charlotte ; Su, Pascal
http://arxiv.org/abs/1912.00230.  , 2019
Link: http://arxiv.org/abs/191..
 
1-15