Brendan Nagle

1. The counting lemma for regulark‐uniform hypergraphs
   2006/01/18 by Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 3 citations
   Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Graph theory and applications #Lemma (botany) #Hypergraph #Combinatorics #Mathematics #Mathematical proof #Graph #Discrete mathematics
2. Tiling 3-uniform hypergraphs with K₄³-2e
   2011/08/20 by Andrzej Czygrinow, Czygrinow, Andrzej, Louis DeBiasio +3 · 2 citations
   Mathematics · #05C35 #05C65 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C35 #msc:05C65 #msc:05C70
3. On two-coloring bipartite uniform hypergraphs
   2024/04/07 by Boyoon Lee, Lee, Boyoon, Theodore Molla +3 · 1 citation
   Engineering · Computer Science · #graph theory and CDMA systems #Graph Labeling and Dimension Problems