Pages that link to "Item:Q4268877"

The following pages link to The Algorithmic Aspects of Uncrowded Hypergraphs (Q4268877):

Displaying 14 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
• On the independence number of non-uniform uncrowded hypergraphs (Q776287) (← links)
• Large triangles in the \(d\)-dimensional unit cube (Q860817) (← links)
• Distributions of points in \(d\) dimensions and large \(k\) -point simplices (Q958238) (← links)
• Point sets in the unit square and large areas of convex hulls of subsets of points (Q1016043) (← links)
• On sets of points that determine only acute angles (Q1024284) (← links)
• Uncrowding algorithm for hook-valued tableaux (Q2128846) (← links)
• Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
• Distributions of points in the unit square and large \(k\)-gons (Q2427543) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Generalizations of Heilbronn's Triangle Problem (Q3503518) (← links)
• No l Grid-Points in Spaces of Small Dimension (Q3511434) (← links)
• Heilbronn triangle‐type problems in the unit square [0,1]² (Q6074876) (← links)