Pages that link to "Item:Q3159396"
From MaRDI portal
The following pages link to Fractional chromatic number and circular chromatic number for distance graphs with large clique size (Q3159396):
Displaying 20 items.
- On the density of integral sets with missing differences from sets related to arithmetic progressions (Q627623) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- Density of sets with missing differences and applications (Q2054653) (← links)
- Maximal density of integral sets with missing differences and the kappa values (Q2078256) (← links)
- Sequences of integers with three missing separations (Q2297912) (← links)
- Distance graphs with maximum chromatic number (Q2476275) (← links)
- Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem (Q5048455) (← links)
- Fractional DP-chromatic number of planar graphs of large girth (Q5063294) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- (Q5384184) (← links)
- Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings (Q5889217) (← links)
- Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) (Q6171907) (← links)
- Max-norm Ramsey theory (Q6201895) (← links)
