Pages that link to "Item:Q4074927"
From MaRDI portal
The following pages link to Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927):
Displaying 50 items.
- Edge colouring by total labellings (Q960914) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- On a cycle partition problem (Q998373) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- The triangle-free process (Q1023043) (← links)
- \(l\)-trace \(k\)-Sperner families of sets (Q1024991) (← links)
- Critical hypergraphs and interesting set-pair systems (Q1071788) (← links)
- More on maximal intersecting families of finite sets (Q1086235) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Probabilistic methods (Q1091406) (← links)
- Cycles of length 0 modulo k in directed graphs (Q1093650) (← links)
- The linear arboricity of graphs (Q1120581) (← links)
- On 3-chromatic hypergraphs (Q1137600) (← links)
- On maximal intersecting families of finite sets (Q1141651) (← links)
- On positional games (Q1149385) (← links)
- A remark concerning arithmetic progressions (Q1152407) (← links)
- Independent sets in regular graphs and sum-free subsets of finite groups (Q1182658) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- On a combinatorial problem of P. Erdős and L. Lovasz (Q1241757) (← links)
- On codes with the identifiable parent property (Q1268617) (← links)
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration (Q1296753) (← links)
- On a graph colouring problem (Q1297488) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Inequalities for minimal covering sets in set systems of given rank (Q1329820) (← links)
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\) (Q1343782) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Covering with Latin transversals (Q1345959) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Domination by product measures (Q1356331) (← links)
- Hypergraph colouring and the Lovász local lemma (Q1356486) (← links)
- On incidence coloring and star arboricity of graphs (Q1356555) (← links)
- Blocking set free configurations and their relations to digraphs and hypergraphs (Q1356757) (← links)
- Four results about self-blocking clutters (Q1377860) (← links)
- Independent dominating sets and a second hamiltonian cycle in regular graphs (Q1386422) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
- Vertices of small degree in uniquely Hamiltonian graphs (Q1569030) (← links)
- Linear coloring of graphs (Q1584255) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- A new lower bound for van der Waerden numbers (Q1686261) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
