Pages that link to "Item:Q5530478"
From MaRDI portal
The following pages link to On chromatic number of graphs and set-systems (Q5530478):
Displaying 50 items.
- Note on the group edge irregularity strength of graphs (Q2009255) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- From \(A\) to \(B\) to \(Z\) (Q2037088) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Nonfinitely based ai-semirings with finitely based semigroup reducts (Q2079231) (← links)
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra (Q2112572) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- Cycles in color-critical graphs (Q2121717) (← links)
- On the growth rate of chromatic numbers of finite subgraphs (Q2182268) (← links)
- Cusp universality for random matrices. I: Local law and the complex Hermitian case (Q2192723) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- Generalized hypergraph coloring (Q2214310) (← links)
- Strong downward Löwenheim-Skolem theorems for stationary logics. I (Q2219086) (← links)
- Subdivisions of four blocks cycles in digraphs with large chromatic number (Q2235256) (← links)
- Eigenstate thermalization hypothesis for Wigner matrices (Q2244923) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- On the growth rate of dichromatic numbers of finite subdigraphs (Q2286596) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- A note on uncountable chordal graphs (Q2344784) (← links)
- On indicated chromatic number of graphs (Q2361087) (← links)
- A note on the Engelking-Karłowicz theorem (Q2390149) (← links)
- In memoriam: James Earl Baumgartner (1943--2011) (Q2408079) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- On balanced incomplete block designs with specified weak chromatic number (Q2434889) (← links)
- Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl (Q2526108) (← links)
- Separability properties of almost-disjoint families of sets (Q2555499) (← links)
- An interpolation theorem for partitions which are complete with respect to hereditary properties (Q2562787) (← links)
- Colour-critical graphs and hypergraphs (Q2563172) (← links)
- On the chromatic number of Steiner triple systems of order 25 (Q2568479) (← links)
- Cuts and bounds (Q2575795) (← links)
- On a vertex-edge marking game on graphs (Q2660140) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- A note on the connected game coloring number (Q2700603) (← links)
- (Q2741320) (← links)
- (Q2777505) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← links)
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597) (← links)
- Lower bounds on coloring numbers from hardness hypotheses in pcf theory (Q2827384) (← links)
- Cycle length parities and the chromatic number (Q3055917) (← links)
- Combinatorial Dichotomies in Set Theory (Q3083465) (← links)
- Vertex colorings of graphs without short odd cycles (Q3096961) (← links)
- GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES (Q3115483) (← links)
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- Applications of a Set-Theoretic Lemma (Q3338916) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
