Pages that link to "Item:Q1185879"

The following pages link to Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879):

Displaying 38 items.

• A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
• A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← links)
• A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
• Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
• Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
• Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
• Chromatic index of simple hypergraphs (Q2005680) (← links)
• The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
• Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
• Constructing sparse Davenport-Schinzel sequences (Q2182209) (← links)
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
• Fractional aspects of the Erdős-Faber-Lovász conjecture (Q2259581) (← links)
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
• Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• (Q3303467) (← links)
• The Dinitz problem solved for rectangles (Q4275683) (← links)
• (Q4828988) (← links)
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
• Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
• Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
• From NMNR-coloring of hypergraphs to homogenous coloring of graphs (Q5357311) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
• (Q6076845) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
• Near-optimal distributed edge coloring (Q6102321) (← links)
• Monomial invariants applied to graph coloring (Q6116562) (← links)
• Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
• A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
• Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)