Skip to main content

All Questions

Filter by
Sorted by
Tagged with
7 votes
1 answer
436 views

When is a 0-1 matrix a one-intersection incidence matrix?

The following problem is what motivated my previous MO question. It is easily seen that for any given 0-1 matrix $M$, one can always find a set $\mathcal P$ of points, and a set $\mathcal C$ of simple ...
Seva's user avatar
  • 23k
3 votes
1 answer
304 views

Perfect matchings in infinite regular bipartite graphs

This question was motivated by a discussion here and is related to a previous question here. Let $\kappa$ and $\lambda$ be cardinals such that $0<\lambda\leq \kappa$. Let $G=(A\cup B, E)$ be a ...
Louis D's user avatar
  • 1,701
2 votes
1 answer
167 views

graph built from orthogonal Latin Squares

I've asked the following question on MathExchange site, with a bounty, with no answer or comments. Maybe I would have additional comments here. The problem came to be while reading some articles on ...
Thomas Lesgourgues's user avatar
2 votes
0 answers
267 views

On the determinant of incidence matrices (of graphs and other geometries)

Let $\Gamma = (P,L,I)$ be a point-line geometry (here, $P$ is the point set, $L$ the line set, and $I$ is the symmetric incidence relation). (As an example, $\Gamma$ could be a graph.) I suppose $\...
THC's user avatar
  • 4,605
0 votes
1 answer
443 views

About a graph embedding from R^3 to...

I was working on something and stumbled upon the following situation. I have in front of me a configuration $L$ of lines in $\mathbb{R}^{3}$ and say I consider the graph $G$ having as vertex set $L$ ...
Cosmin Pohoata's user avatar