Christian Winter

activity

20182023

most citedA note on saturation for Berge-G hypergraphs

2 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2023

A note on asymmetric hypergraphs

Dominik Bohnert, Christian Winter

A $k$ -graph $G$ is asymmetric if there does not exist an automorphism on $G$ other than the identity, and $G$ is called minimal asymmetric if it is as…

math.CO2023★ 1 cited

On graphs embeddable in a layer of a hypercube and their extremal numbers

Maria Axenovich, Ryan R. Martin, Christian Winter

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_{n}$ , $e x (Q_{n}, H)$ is the largest number of edges in an $H$ -free subgraph of $Q_{n}$ .…

math.CO2022

Poset Ramsey number $R (P, Q_{n})$ . I. Complete multipartite posets

Christian Winter

A poset $(P^{'}, \leq_{P^{'}})$ contains a copy of some other poset $(P, \leq_{P})$ if there is an injection $f : P^{'} \to P$ where for every $X, Y \in P$ , $X \leq_{P} Y$ if and only if $f(X)\le_{P…

math.CO2021

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

Maria Axenovich, Christian Winter

Given partially ordered sets (posets) $(P, \leq_{P})$ and $(P^{'}, \leq_{P^{'}})$ , we say that $P^{'}$ contains a copy of $P$ if for some injective function $f : P \to P^{'}$ and for any $…

math.CO2021

Lower Bound on the Size-Ramsey Number of Tight Paths

Christian Winter

The size-Ramsey number $R^{(k)} (H)$ of a $k$ -uniform hypergraph $H$ is the minimum number of edges in a $k$ -uniform hypergraph $G$ with the property that every ` $2$ -edge coloring'…

cs.DB2019

GeoBlocks: A Query-Cache Accelerated Data Structure for Spatial Aggregation over Polygons

Christian Winter, Andreas Kipf, Christoph Anneser +3

As individual traffic and public transport in cities are changing, city authorities need to analyze urban geospatial data to improve transportation and infrastructure. To that end,…

math.CO2018★ 2 cited

A note on saturation for Berge-G hypergraphs

Maria Axenovich, Christian Winter

For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, whe…

A note on asymmetric hypergraphs

On graphs embeddable in a layer of a hypercube and their extremal numbers

Poset Ramsey number R(P,Qn​). I. Complete multipartite posets

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

Lower Bound on the Size-Ramsey Number of Tight Paths

GeoBlocks: A Query-Cache Accelerated Data Structure for Spatial Aggregation over Polygons

A note on saturation for Berge-G hypergraphs

Poset Ramsey number $R (P, Q_{n})$ . I. Complete multipartite posets