Semantic Scholar uses AI to extract papers important to this topic.
A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an… Expand The celebrated Erdos–Faber–Lovasz conjecture originated in the year 1972. It can be stated as follows: any linear hypergraph on n… Expand We consider the Erdős-Faber-Lovász (EFL) conjecture for hypergraphs that are both regular and uniform. This paper proves that for… Expand This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like “holonomy”, “parallel… Expand The classical question raised by Lovasz asks whether every Cayley graph is Hamiltonian. We present a short survey of various… Expand In this article current directions in solving Lovasz's problem about the existence of Hamilton cycles and paths in connected… Expand A hypergraph, having n edges, is linear if no two distinct edges intersect in more than one vertex, and is dense if its minimum… Expand A hypergraph H is linear if no two distinct edges of H intersect in more than one vertex and loopless if no edge has size one. A… Expand To any two graphs G and H one can associate a cell complex Horn (G, H) by taking all graph multihomomorphisms from G to H as… Expand LetH be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real… Expand