Philipp Heering

works on

chromatic number 1 design theory 1 graph theory 1 incidence-free sets 1 kneser graphs 1 projective planes 1

From the 1 of 6 linked papers with an AI index.

collaborators

6 papers

math.CO2026

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

Philipp Heering, Klaus Metsch, Vladislav Taranchuk +1

The paper provides an elementary proof of a perfect matching in the incidence graph of a symmetric design, links the chromatic number of Kneser graphs on projective‑plane chambers…

cs.IT2026

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions

Philipp Heering, Christian Kaspers, Vladislav Taranchuk

A function $F : F_{2}^{n} \to F_{2}^{m}$ is called $k$ th-order sum-free if the sum of its values over any $k$ -dimensional affine subspace of $F_{2}^{n}$ is non-…

math.CO2026

Cocliques in the Kneser graph on $(n - 1, n)$ -flags of PG $(2 n, q)$

Philipp Heering

In the finite projective space PG $(2 n, q)$ we consider flags of type $(n - 1, n)$ , that is, pairs $(A, B)$ consisting of an $(n - 1)$ -space $A$ and an $n$ -space $B$ that are incident. Two…

math.CO2025

Line-parallelisms of PG $(n, 2)$ from Preparata-like codes

Philipp Heering, Vladislav Taranchuk

Partitions of the binary linear Hamming code into Preparata-like codes are known to induce line-parallelisms of PG $(n, 2)$ . In this paper, we show that if $P$ is any Preparata-like…

math.CO2025

On the ErdÅs-Ko-Rado problem of flags with type ${1, n - 3}$ of finite sets

Philipp Heering

A flag of a finite set $S$ is a set $f$ of non-empty, proper subsets of $S$ , such that $X \subseteq Y$ or $Y \subseteq X$ for all $X, Y \in f$ . Two flags $f_{1}$ and $f_{2}$ of $S$ are opp…

math.CO2025

The largest sets of non-opposite chambers in spherical buildings of type $B$

Jan De Beule, Philipp Heering, Sam Mattheus +1

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending…

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions

Cocliques in the Kneser graph on (n−1,n)-flags of PG(2n,q)

Line-parallelisms of PG(n,2) from Preparata-like codes

On the ErdÅs-Ko-Rado problem of flags with type {1,n−3} of finite sets

The largest sets of non-opposite chambers in spherical buildings of type B

Cocliques in the Kneser graph on $(n - 1, n)$ -flags of PG $(2 n, q)$

Line-parallelisms of PG $(n, 2)$ from Preparata-like codes

On the ErdÅs-Ko-Rado problem of flags with type ${1, n - 3}$ of finite sets

The largest sets of non-opposite chambers in spherical buildings of type $B$